Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Kryptosystém RSA× | AES (Rijndael)× | Kryptografie eliptických křivek× | |
|---|---|---|---|
| Obor | Kryptografie | Kryptografie | Kryptografie |
| Rodina | Machine learning | Machine learning | Machine learning |
| Rok vzniku≠ | 1978 | 2001 | 1985 |
| Tvůrce≠ | Ronald Rivest | Joan Daemen | Neal Koblitz |
| Typ≠ | asymmetric encryption algorithm | symmetric encryption algorithm | asymmetric encryption and key agreement |
| Původní zdroj≠ | 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 ↗ | Daemen, J., & Rijmen, V. (2002). The Design of Rijndael: AES - The Advanced Encryption Standard. Springer-Verlag. ISBN: 978-3540425809 | 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 ↗ |
| Další názvy≠ | RSA encryption, RSA public-key cryptography | Rijndael, AES encryption, FIPS 197 | ECC, elliptic curve cryptosystem |
| Příbuzné≠ | 4 | 4 | 3 |
| Shrnutí≠ | 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. | The Advanced Encryption Standard (AES), also known as Rijndael, is a symmetric block cipher adopted as the official encryption standard by the U.S. government in 2001. It processes data in 128-bit blocks using 128, 192, or 256-bit keys and performs multiple rounds of substitution, permutation, and mixing operations. AES is the most widely used symmetric encryption algorithm today, securing everything from government communications to everyday internet traffic. | 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. |
| ScholarGateDatová sada ↗ |
|
|
|