Compact and Scalable Arbitrary-centered Discrete Gaussian Sampling over Integers

The arbitrary-centered discrete Gaussian sampler is a fundamental subroutine in implementing lattice trapdoor sampling algorithms. However, existing approaches typically rely on either a fast implementation of another discrete Gaussian sampler or pre-computations with regards to some specific discrete Gaussian distributions with fixed centers and standard deviations. These approaches may only support sampling from standard deviations within a limited range, or cannot efficiently sample from arbitrary standard deviations determined on-the-fly at run-time.

[1]  Pierre-Alain Fouque,et al.  Practical Implementation of Ring-SIS/LWE Based Signature and IBE , 2018, PQCrypto.

[2]  Léo Ducas,et al.  Efficient Identity-Based Encryption over NTRU Lattices , 2014, ASIACRYPT.

[3]  Daniele Micciancio,et al.  Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time , 2017, CRYPTO.

[4]  Huang Zhang,et al.  A rejection sampling algorithm for off-centered discrete Gaussian distributions over the integers , 2017, Science China Information Sciences.

[5]  Carlos Aguilar-Melchor,et al.  CDT-Based Gaussian Sampling: From Multi to Double Precision , 2018, IEEE Transactions on Computers.

[6]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[7]  Chris Peikert,et al.  An Efficient and Parallel Gaussian Sampler for Lattices , 2010, CRYPTO.

[8]  Thomas Prest,et al.  Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence , 2017, ASIACRYPT.

[9]  Martin R. Albrecht,et al.  Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography , 2017, ACNS.

[10]  Zhenfei Zhang,et al.  Falcon: Fast-Fourier Lattice-based Compact Signatures over NTRU , 2019 .

[11]  Tanja Lange,et al.  Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto , 2017, IACR Cryptol. ePrint Arch..

[12]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[13]  Ron Steinfeld,et al.  Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance , 2015, Journal of Cryptology.

[14]  Wayne Luk,et al.  Gaussian random number generators , 2007, CSUR.

[15]  Léo Ducas,et al.  Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic , 2012, ASIACRYPT.

[16]  Thomas Ricosset,et al.  Simple , Fast and Constant-Time Gaussian Sampling over the Integers for Falcon , 2019 .

[17]  Charles F. F. Karney Sampling Exactly from the Normal Distribution , 2013, ACM Trans. Math. Softw..

[18]  Léo Ducas,et al.  Lattice Signatures and Bimodal Gaussians , 2013, IACR Cryptol. ePrint Arch..

[19]  Ron Steinfeld,et al.  FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers , 2020, IEEE Transactions on Computers.

[20]  L. Devroye Non-Uniform Random Variate Generation , 1986 .