Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256
From MaRDI portal
Publication:3634493
DOI10.1007/978-3-642-02620-1_13zbMath1307.94113OpenAlexW1824475610MaRDI QIDQ3634493
Publication date: 25 June 2009
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_13
Related Items (2)
A fast pseudorandom number generator with BLAKE hash function ⋮ Fast correlation attack on stream cipher ABC v3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approximate reasoning theory suitable for both propositional calcus system\(\mathcal L^\ast\) and predicate calculus system \(\mathcal K^\ast\)
- Cryptanalysis of MD4
- New Distinguishing Attack on MAC Using Secret-Prefix Method
- Keying Hash Functions for Message Authentication
- Collisions for Step-Reduced SHA-256
- On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract)
- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- Cryptanalysis of the Full HAVAL with 4 and 5 Passes
- Analysis of Step-Reduced SHA-256
- Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC
- Collisions and Other Non-random Properties for Step-Reduced SHA-256
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- How to Break MD5 and Other Hash Functions
- On Authentication with HMAC and Non-random Properties
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions
- New Collision Attacks against Up to 24-Step SHA-2
- Cryptology and Network Security
This page was built for publication: Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256
