विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| HMAC× | रेखीय क्रिप्ट विश्लेषण× | |
|---|---|---|
| क्षेत्र | क्रिप्टोग्राफी | क्रिप्टोग्राफी |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1997 | 1993 |
| प्रवर्तक≠ | Hugo Krawczyk | Mitsuru Matsui |
| प्रकार≠ | cryptographic authentication mechanism | linear approximation attack |
| मौलिक स्रोत≠ | Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104. link ↗ | Matsui, M. (1993). Linear cryptanalysis method for DES cipher. In Advances in Cryptology - EUROCRYPT 1993, LNCS 765, pp. 386-397. DOI ↗ |
| उपनाम≠ | HMAC, keyed hash function | linear attack, linear approximation, piling-up lemma |
| संबंधित | 3 | 3 |
| सारांश≠ | 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. | Linear cryptanalysis is a known-plaintext attack that exploits linear approximations of a cipher's non-linear transformations to recover secret key bits. Introduced by Mitsuru Matsui in 1993, linear cryptanalysis provides practical attacks on ciphers like DES with computational complexity less than brute force. The technique analyzes statistical biases in how linear combinations of plaintext and ciphertext bits relate to key bits, enabling key recovery with reduced data requirements. |
| ScholarGateडेटासेट ↗ |
|
|