Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Криптосистема RSA× | Диференційний криптоаналіз× | |
|---|---|---|
| Галузь | Криптографія | Криптографія |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1978 | 1990 |
| Автор методу≠ | Ronald Rivest | Eli Biham |
| Тип≠ | asymmetric encryption algorithm | statistical attack on block ciphers |
| Основоположне джерело≠ | 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 ↗ | Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21. DOI ↗ |
| Інші назви≠ | RSA encryption, RSA public-key cryptography | differential attack, differential path, differential probability |
| Пов'язані≠ | 4 | 3 |
| Підсумок≠ | 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. | 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. |
| ScholarGateНабір даних ↗ |
|
|