Paper 2017/285

Implementation and Evaluation of Improved Gaussian Sampling for Lattice Trapdoors

Kamil Doruk Gür, Yuriy Polyakov, Kurt Rohloff, Gerard W. Ryan, and Erkay Savaş


We report on our implementation of a new Gaussian sampling algorithm for lattice trapdoors. Lattice trapdoors are used in a wide array of lattice-based cryptographic schemes including digital signatures, attributed-based encryption, program obfuscation and others. Our implementation provides Gaussian sampling for trapdoor lattices with prime moduli, and supports both single- and multi-threaded execution. We experimentally evaluate our implementation through its use in the GPV hash-and-sign digital signature scheme as a benchmark. We compare our design and implementation with prior work reported in the literature. The evaluation shows that our implementation 1) has smaller space requirements and faster runtime, 2) does not require multi-precision floating-point arithmetic, and 3) can be used for a broader range of cryptographic primitives than previous implementations.

Available format(s)
Publication info
Published elsewhere. WAHC 2018 – 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography
Contact author(s)
polyakov @ njit edu
2018-10-03: last of 2 revisions
2017-03-30: received
See all versions
Short URL
Creative Commons Attribution


      author = {Kamil Doruk Gür and Yuriy Polyakov and Kurt Rohloff and Gerard W.  Ryan and Erkay Savaş},
      title = {Implementation and Evaluation of Improved Gaussian Sampling for Lattice Trapdoors},
      howpublished = {Cryptology ePrint Archive, Paper 2017/285},
      year = {2017},
      doi = {10.1145/3267973.3267975},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.