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