השוואת שיטות

	קריפטוגרפיה מבוססת סריגים	קריפטוגרפיה פוסט-קוונטית (Kyber)
תחום	קריפטוגרפיה	קריפטוגרפיה
משפחה	Machine learning	Machine learning
שנת המקור	1996	2022
הוגה השיטה	Miklós Ajtai	NIST PQC Standardization Project
סוג	public-key cryptosystem based on lattice hardness	post-quantum key encapsulation mechanism
מקור מכונן	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.	Avanzi, R., Bos, J., Ducas, L., & Kiltz, E. (2022). CRYSTALS-Kyber algorithm specification and supporting documentation. NIST Post-Quantum Cryptography Project.
כינויים	lattice cryptography, post-quantum lattice cryptography	PQC, quantum-resistant cryptography, quantum-safe
קשורות	3	3
תקציר	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.	Post-quantum cryptography comprises cryptographic algorithms believed to be secure against both classical and quantum computers. In 2022, NIST standardized post-quantum algorithms including ML-KEM (CRYSTALS-Kyber) for key encapsulation and ML-DSA (CRYSTALS-Dilithium) for signatures. Post-quantum cryptography is essential for systems requiring long-term confidentiality, as adversaries may record encrypted communications today and decrypt them once quantum computers become available.