Lattice Signatures and Bimodal Gaussians

By Léo Ducas, Alain Oliviero Durmus, Tancrède Lepoint, Vadim Lyubashevsky. IACR Cryptology ePrint Archive, 2013

638 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/16d916b69aa99a32d999068a376a5b4e96bfbd07

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Information Systems

Citations in the corpus

Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM (2018, background): “A significant number of papers [27,44,39,18,25,26] improve the performance of discrete Gaussian sampling.”
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, methodology): “The most compact lattice-based signature schemes [DDLL13, DLP14] crucially require the generation of secret randomness from the discrete Gaussian distribution.”
Post-quantum Key Exchange - A New Hope (2016, methodology): “For encryption and signatures, several competitive schemes have been proposed; examples are NTRU encryption [48, 78], Ring-LWE encryption [62] as well as the signature schemes BLISS [31], PASS [47] or the proposal by Bai and Galbraith presented in [6].”
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, methodology): “17 Key sizes and signature sizes from BLISS were taken from [36], as they were not readily available in the implementation.”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “Besides BLISS, there are in the literature other lattice-based signature schemes that rely on the SIS problem but that were devised specifically for blockchains [170].”
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes (2016, background): “In addition to encryption/signature schemes ([15, 25, 18, 7, 21, 22]), identity-based encryption [8], multilinear maps [10, 16], lattices are also involved in homomorphic encryption (HE).”
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016, methodology): “P¨oppelmann et al. [26] avoid the ﬁnal scaling by n − 1 during the inverse NTT by shifting the computation to a polynomial transformation that is (in their target application of BLISS signatures) assumedly performed oﬄine.”
Post-quantum cryptography (2008, positive): “Later proposals such as BLISS [41] improve the running time by reducing the frequency of rejection in the last step.”
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (2020, background): “In addition, much of the development of lattice-based signature schemes, identity-based encryption, and other cryptosystems has centered around eﬃciently sampling from discrete Gaussians (see, e.g., [GPV08, Pei10, MP12, DDLL13, DLP14, MW17]), as well as the analysis of various kinds of combinations ”