Jämför metoder

	RSA-kryptosystem	Differential cryptanalysis
Ämnesområde	Kryptografi	Kryptografi
Familj	Machine learning	Machine learning
Ursprungsår	1978	1990
Upphovsperson	Ronald Rivest	Eli Biham
Typ	asymmetric encryption algorithm	statistical attack on block ciphers
Ursprungskälla	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.	Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21.
Alias	RSA encryption, RSA public-key cryptography	differential attack, differential path, differential probability
Närliggande	4	3
Sammanfattning	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.