<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for sampling from discrete Gaussians. Then we survey the algorithms implementing such sampling and assess their practical performance. Finally we draw some conclusions regarding the best candidates for implementation on different platforms in the typical parameter range</p></abstract>

Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for sampling from discrete Gaussians. Then we survey the algorithms implementing such sampling and assess their practical performance. Finally we draw some conclusions regarding the best candidates for implementation on different platforms in the typical parameter range

Gaussian Sampling in Lattice Based Cryptography

Department of Computer Science Faculty of Informatics University of Debrecen Kassai Street 26 H-4028 Debrecen HUNGARY

Tatra Mountains Mathematical Publications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Gaussian Sampling in Lattice Based Cryptography"}

Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for...

Gaussian Sampling in Lattice Based Cryptography

Online veröffentlicht: 11. März 2015

Seitenbereich: 1 - 23

Eingereicht: 25. Aug. 2014

DOI: https://doi.org/10.2478/tmmp-2014-0022

Schlüsselwörter
lattice-based cryptography, Gaussian sampling, practicality, Knuth-Yao, Ziggurat, BLISS, learning with errors, Lyubashevsky signature

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Gaussian Sampling in Lattice Based Cryptography

Online veröffentlicht: 11. März 2015

Seitenbereich: 1 - 23

Eingereicht: 25. Aug. 2014

DOI: https://doi.org/10.2478/tmmp-2014-0022

Schlüsselwörterlattice-based cryptography, Gaussian sampling, practicality, Knuth-Yao, Ziggurat, BLISS, learning with errors, Lyubashevsky signature

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Schlüsselwörter
lattice-based cryptography, Gaussian sampling, practicality, Knuth-Yao, Ziggurat, BLISS, learning with errors, Lyubashevsky signature