- Lattice-based cryptography - Wikipedia
Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof Lattice-based constructions support important standards of post-quantum cryptography [1] Unlike more widely used and known public-key schemes such as the RSA, Diffie-Hellman or elliptic-curve cryptosystems—which could
- Lattice problem - Wikipedia
Lattice problem In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices
- GGH encryption scheme - Wikipedia
The Goldreich–Goldwasser–Halevi (GGH) lattice-based cryptosystem is a broken asymmetric cryptosystem based on lattices There is also a GGH signature scheme which hasn't been broken as of 2024 The Goldreich–Goldwasser–Halevi (GGH) cryptosystem makes use of the fact that the closest vector problem can be a hard problem This system was published in 1997 by Oded Goldreich, Shafi
- Falcon (signature scheme) - Wikipedia
Falcon is a post-quantum signature scheme selected by the NIST at the fourth round of the post-quantum standardisation process It was designed by Thomas Prest, Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang [1][2][3] It relies on the hash-and-sign technique over the Gentry, Peikert
- NTRU - Wikipedia
NTRU is an open-source public-key cryptosystem that uses lattice-based cryptography to encrypt and decrypt data It consists of two algorithms: NTRUEncrypt, which is used for encryption, and NTRUSign, which is used for digital signatures
- Post-quantum cryptography - Wikipedia
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key algorithms) that are currently thought to be secure against a cryptanalytic attack by a quantum computer [1]
- Oded Regev (computer scientist) - Wikipedia
Oded Regev (Hebrew: עודד רגב; born 1978) is an Israeli-American theoretical computer scientist and mathematician He is a professor of computer science at the Courant institute at New York University [3] He is best known for his work in lattice-based cryptography, and in particular for introducing the learning with errors problem
|