Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Криптография на эллиптических кривых× | Постквантовая криптография (Kyber)× | Криптосистема RSA× | |
|---|---|---|---|
| Область | Криптография | Криптография | Криптография |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 1985 | 2022 | 1978 |
| Автор метода≠ | Neal Koblitz | NIST PQC Standardization Project | Ronald Rivest |
| Тип≠ | asymmetric encryption and key agreement | post-quantum key encapsulation mechanism | asymmetric encryption algorithm |
| Основополагающий источник≠ | 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 ↗ | Avanzi, R., Bos, J., Ducas, L., & Kiltz, E. (2022). CRYSTALS-Kyber algorithm specification and supporting documentation. NIST Post-Quantum Cryptography Project. link ↗ | Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126. DOI ↗ |
| Другие названия≠ | ECC, elliptic curve cryptosystem | PQC, quantum-resistant cryptography, quantum-safe | RSA encryption, RSA public-key cryptography |
| Связанные≠ | 3 | 3 | 4 |
| Сводка≠ | 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. | 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. | RSA is a foundational public-key cryptosystem developed by Rivest, Shamir, and Adleman in 1978. It enables secure encryption and digital signatures by using a pair of mathematically linked keys: a public key for encryption and a private key for decryption. RSA's security relies on the computational difficulty of factoring large composite numbers into their prime factors. |
| ScholarGateНабор данных ↗ |
|
|
|