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.
Allikakirje
Tsiteeringud kopeeritud meetodi allikakirjest sõna-sõnalt. Nendest ei saa järeldada väidete tasemel kinnitust.
- 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. · URL
- Regev, O. (2005). On lattices, learning with errors, hard instances, and public key cryptography. In Proceedings of STOC 2005, pp. 84-93. · URL
Kureeritud väited
Väited on salvestatud tõendite registrisse, igal oma hinnanguga.
See vaade ei loo väite hinnangut, kui registris seda pole.
Seotud meetodid
Genereeritud meetodigraafist ja kuvatud masina soovitatud seostena – väiteid ei järeldata.