Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| HMAC× | Criptanaliza diferențială× | |
|---|---|---|
| Domeniu | Criptografie | Criptografie |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1997 | 1990 |
| Autorul original≠ | Hugo Krawczyk | Eli Biham |
| Tip≠ | cryptographic authentication mechanism | statistical attack on block ciphers |
| Sursa seminală≠ | Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104. link ↗ | Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21. DOI ↗ |
| Denumiri alternative≠ | HMAC, keyed hash function | differential attack, differential path, differential probability |
| Înrudite | 3 | 3 |
| Rezumat≠ | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|