Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Książka = Book ; KS/4/2009/T11P10
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[2], 115-131 pages ; 21 cm ; Bibliography p. 131
The paper presents new algorithms for fast computing polynomial transformations and theirs applications in data encryption, secret sharing and e-voting. These algorithms use, in the essential way, algorithms for computing multidimensional convolutions and deconvolutions based on the FFT algorithm over finite fields.
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 15, 2021
Jul 19, 2021
33
https://rcin.org.pl./publication/234663