Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Criptanaliza diferențială× | Criptografia cu curbe eliptice× | |
|---|---|---|
| Domeniu | Criptografie | Criptografie |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1990 | 1985 |
| Autorul original≠ | Eli Biham | Neal Koblitz |
| Tip≠ | statistical attack on block ciphers | asymmetric encryption and key agreement |
| Sursa seminală≠ | Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21. 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 ↗ |
| Denumiri alternative≠ | differential attack, differential path, differential probability | ECC, elliptic curve cryptosystem |
| Înrudite | 3 | 3 |
| Rezumat≠ | Differential cryptanalysis is a statistical attack technique on symmetric block ciphers that analyzes differences in inputs and outputs to recover secret keys. Introduced by Eli Biham and Adi Shamir in 1990, differential cryptanalysis was the first practical attack on DES that outperformed brute force search. The technique exploits non-random properties of cipher transformations by studying how small changes in plaintext propagate through the cipher rounds. Differential cryptanalysis has shaped cipher design for three decades. | 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 ↗ |
|
|