Post-quantum Key Exchange - A New Hope

By E. Alkım, Léo Ducas, Thomas Pöppelmann, Peter Schwabe. USENIX Security Symposium, 2016

992 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/ca815115e63d4562208e9dbc1d504ab8ae5d2439

How researchers see this paper

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

1. Shai Halevi
2. Hao Chen
3. Dan Boneh
4. Craig Gentry
5. Kim Laine
6. Chris Peikert
7. Vadim Lyubashevsky
8. Léo Ducas

Citations in the corpus

• Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, methodology): “For example, lattice-based schemes like NTRU [118] or NewHope [119] often require to manage keys in the order of a few thousand bits.”
• A Modular Analysis of the Fujisaki-Okamoto Transformation (2017, background): “Dealing with imperfectly correct schemes is of great importance since many (but not all) practical lattice-based encryption schemes have a small correctness error, see, e.g., DXL [21], Peikert [34], BCNS [14], New Hope [3], Frodo [13], Lizard [17], and Kyber [12].”
• Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme (2019, methodology): “In particular the LIMA algorithm uses the method of approximating a Discrete Gaussian via a centred binomial distribution given in [2], to produce a Gaussian with standard deviation about 3.”
• Homomorphic Encryption Standard (2019, background): “The “ADPS16” from (Alkim et al., 2016) suppresses the o(β) term completely.”
• Zero Trust Architecture (ZTA): A Comprehensive Survey (2022, methodology): “However, even without standardization, Google recently conducted some experiments with Lattice-based cryptosystems and demonstrated their appropriateness in large scale encryption cracking applications [188], [189].”
• TFHE: Fast Fully Homomorphic Encryption Over the Torus (2019, background): “0 have been proposed in the literature [3,4,6,7,17].”
• Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016, methodology): “In general, however, that assumption does not necessarily hold; for example, in [2], all of the polynomials to be multiplied are generated fresh per key exchange connection.”
• CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017, methodology): “i According to the conservative “best known quantum attack” estimates from [4], with appropriate adaptations (balanced lattice attacks [28, Sec.”
• Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM (2018, methodology): “This motivated the authors of NewHope [4] to use a centered binomial distribution instead of a Gaussian distribution.”
• Post-quantum cryptography (2008, unknown): “A notable example is Google’s recent experiment [53] with the recent “New Hope” [54] lattice-based cryptosystem: an update to the Google Chrome browser automatically encrypted data with New Hope (and with ECC) for a fraction of all Chrome users connecting to Google web sites.”
• Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE (2016, methodology): “At approximately 1.3ms for each party, the runtime of Frodo is orders of magnitude faster than SIDH, faster than NTRU (on the server side), about 1.8 × slower than ECDH nistp256 , and about 9 × slower than R-LWE (NewHope).”