השוואת שיטות

	קריפטואנליזה דיפרנציאלית	HMAC	מערכת הצפנה RSA
תחום	קריפטוגרפיה	קריפטוגרפיה	קריפטוגרפיה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1990	1997	1978
הוגה השיטה	Eli Biham	Hugo Krawczyk	Ronald Rivest
סוג	statistical attack on block ciphers	cryptographic authentication mechanism	asymmetric encryption algorithm
מקור מכונן	Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21.	Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104.	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.
כינויים	differential attack, differential path, differential probability	HMAC, keyed hash function	RSA encryption, RSA public-key cryptography
קשורות	3	3	4
תקציר	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.	HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm for authenticating messages using a secret key and a hash function. Standardized in RFC 2104 (1997), HMAC can be combined with any cryptographic hash function (SHA-256, SHA-3, etc.) to create a message authentication code (MAC). HMAC provides both data integrity and authentication, detecting both accidental corruption and deliberate tampering, and is widely used in web security (TLS/SSL), API authentication, and network protocols.	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.