Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Criptografie Post-Cuantică (Kyber)× | Criptografia cu curbe eliptice× | |
|---|---|---|
| Domeniu | Criptografie | Criptografie |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2022 | 1985 |
| Autorul original≠ | NIST PQC Standardization Project | Neal Koblitz |
| Tip≠ | post-quantum key encapsulation mechanism | asymmetric encryption and key agreement |
| Sursa seminală≠ | Avanzi, R., Bos, J., Ducas, L., & Kiltz, E. (2022). CRYSTALS-Kyber algorithm specification and supporting documentation. NIST Post-Quantum Cryptography Project. link ↗ | Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426. DOI ↗ |
| Denumiri alternative≠ | PQC, quantum-resistant cryptography, quantum-safe | ECC, elliptic curve cryptosystem |
| Înrudite | 3 | 3 |
| Rezumat≠ | 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. | Elliptic Curve Cryptography (ECC) is a public-key cryptosystem based on the algebraic structure of elliptic curves over finite fields. Proposed independently by Neal Koblitz and Victor Miller in 1985, ECC offers equivalent security to RSA with much smaller key sizes. Modern cryptography increasingly favors ECC for its efficiency: a 256-bit ECC key provides security comparable to a 2048-bit RSA key, making it ideal for constrained environments and high-performance systems. |
| ScholarGateSet de date ↗ |
|
|