পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| পোস্ট-কোয়ান্টাম ক্রিপ্টোগ্রাফি (কাইবার)× | ল্যাটিস-ভিত্তিক ক্রিপ্টোগ্রাফি× | |
|---|---|---|
| ক্ষেত্র | ক্রিপ্টোগ্রাফি | ক্রিপ্টোগ্রাফি |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 2022 | 1996 |
| প্রবর্তক≠ | NIST PQC Standardization Project | Miklós Ajtai |
| ধরন≠ | post-quantum key encapsulation mechanism | public-key cryptosystem based on lattice hardness |
| মৌলিক উৎস≠ | Avanzi, R., Bos, J., Ducas, L., & Kiltz, E. (2022). CRYSTALS-Kyber algorithm specification and supporting documentation. NIST Post-Quantum Cryptography Project. link ↗ | 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. link ↗ |
| অপর নাম≠ | PQC, quantum-resistant cryptography, quantum-safe | lattice cryptography, post-quantum lattice cryptography |
| সম্পর্কিত | 3 | 3 |
| সারসংক্ষেপ≠ | 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. | 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. |
| ScholarGateডেটাসেট ↗ |
|
|