NewHope is a KEM based on the presumed hardness of the RLWE problem. New Hope did not select for the 3rd round of NIST PQC.
NewHope is a KEM based on the presumed hardness of the RLWE problem.
At its core is Regev’s original idea for public-key encryption from plain LWE but specialized to a power-of-2 cyclotomic ring structure, enabling smaller ciphertext and key sizes as well as fast computations via NTT.
CCA security is achieved by a standard flavor of Fujisaki-Okamoto transform and is supported by proofs in the classical and quantum random oracle models.
Among all LWE-based lattice submissions, NewHope (and other RLWE schemes) can be viewed as the most structured, with MLWE being an intermediately structured case and plain LWE being the least structured case.
New Hope did not select for the 3rd round of NIST PQC.