Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Differensiell kryptanalyse× | RSA-kryptosystemet× | |
|---|---|---|
| Fagfelt | Kryptografi | Kryptografi |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 1990 | 1978 |
| Opphavsperson≠ | Eli Biham | Ronald Rivest |
| Type≠ | statistical attack on block ciphers | asymmetric encryption algorithm |
| Opprinnelig kilde≠ | Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21. 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 ↗ |
| Alias≠ | differential attack, differential path, differential probability | RSA encryption, RSA public-key cryptography |
| Relaterte≠ | 3 | 4 |
| Sammendrag≠ | 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. | 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. |
| ScholarGateDatasett ↗ |
|
|