Machine learningPost-quantum cryptography
Lattice-Based Cryptography
Lattice-based cryptography is a class of cryptosystems whose security is derived from the computational hardness of lattice problems, particularly the shortest vector problem (SVP) and learning with errors (LWE). First proposed by Miklós Ajtai in 1996, lattice-based approaches have gained prominence as the leading candidates for post-quantum cryptography. Unlike RSA and ECC, which are vulnerable to quantum computers, lattice problems are believed to remain hard even against quantum algorithms.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Ajtai, M. (1996). Generating hard instances of the short basis problem. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 99-108. DOI: 10.1145/237814.237838 ↗
- Regev, O. (2005). On lattices, learning with errors, hard instances, and public key cryptography. In Proceedings of STOC 2005, pp. 84-93. DOI: 10.1145/1060590.1060603 ↗