It is known that the development of quantum computers will breakthe cryptographic schemes that are in use today. Since Shor's algorithm is ableto solve the factoring and discrete logarithm problems, all cryptographic systemsbased on these two problems will get broken in the presence of large-scale quantumcomputers. Lattice-based schemes, however, are considered secure against attackswith these new machines. In this paper we present an overview of lattice-basedcryptosystems, showing the most recent and the most promising candidates forencryption and signatures based on lattice problems. We explain the advantagesand disadvantages of the cryptographic schemes. We also adjoin details aboutzero knowledge identication. With this work we try to give insight to one of themost promising candidates of future cryptography, for the time when potentialquantum computers exist. We also point out drawbacks of these systems, whichdiscloses directions for future work in lattice-based cryptography.
@article{202,
title = {A selection of recent lattice-based signature and encryption schemes},
journal = {Tatra Mountains Mathematical Publications},
volume = {51},
year = {2012},
doi = {10.2478/tatra.v53i0.202},
language = {EN},
url = {http://dml.mathdoc.fr/item/202}
}
El Bansarkhani, Rachid; Cabarcas, Daniel; Kuo, Po-Chun; Schmidt, Patrick; Schneider, Michael. A selection of recent lattice-based signature and encryption schemes. Tatra Mountains Mathematical Publications, Tome 51 (2012) . doi : 10.2478/tatra.v53i0.202. http://gdmltest.u-ga.fr/item/202/