Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Criptossistema RSA× | Criptografia de Curva Elíptica× | |
|---|---|---|
| Área | Criptografia | Criptografia |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1978 | 1985 |
| Autor original≠ | Ronald Rivest | Neal Koblitz |
| Tipo≠ | asymmetric encryption algorithm | asymmetric encryption and key agreement |
| Fonte seminal≠ | 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 ↗ | 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 ↗ |
| Outros nomes | RSA encryption, RSA public-key cryptography | ECC, elliptic curve cryptosystem |
| Relacionados≠ | 4 | 3 |
| Resumo≠ | 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. | 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. |
| ScholarGateConjunto de dados ↗ |
|
|