方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 后量子密码学（Kyber）× | 基于格的密码学× | |
|---|---|---|
| 领域 | 密码学 | 密码学 |
| 方法族 | 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数据集 ↗ |
|
|