In post-quantum cryptography, NewHope is a key-agreement protocol by Erdem Alkim, Léo Ducas, Thomas Pöppelmann, and Peter Schwabe that is designed to resist quantum computer attacks. [1] [2]
NewHope is based on a mathematical problem ring learning with errors (RLWE) that is believed to be difficult to solve. NewHope has been selected as a round-two contestant in the NIST Post-Quantum Cryptography Standardization competition, [3] and was used in Google's CECPQ1 experiment as a quantum-secure algorithm, alongside the classical X25519 algorithm. [4] [5]
The designers of NewHope made several choices in developing the algorithm: [6]
In post-quantum cryptography, NewHope is a key-agreement protocol by Erdem Alkim, Léo Ducas, Thomas Pöppelmann, and Peter Schwabe that is designed to resist quantum computer attacks. [1] [2]
NewHope is based on a mathematical problem ring learning with errors (RLWE) that is believed to be difficult to solve. NewHope has been selected as a round-two contestant in the NIST Post-Quantum Cryptography Standardization competition, [3] and was used in Google's CECPQ1 experiment as a quantum-secure algorithm, alongside the classical X25519 algorithm. [4] [5]
The designers of NewHope made several choices in developing the algorithm: [6]