Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others
From MaRDI portal
Publication:3634495
DOI10.1007/978-3-642-02620-1_15zbMath1284.94107OpenAlexW2119481050MaRDI QIDQ3634495
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_15
Related Items
Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD, Cryptanalysis of full \texttt{RIPEMD-128}, An improved preimage attack against \texttt{HAVAL-3}, (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- RIPEMD with two-round compress function is not collision-free
- Cryptanalysis of MD4
- The RIPEMDL and RIPEMDR Improved Variants of MD4 Are Not Collision Free
- On the Collision Resistance of RIPEMD-160
- MD4 is Not One-Way
- Preimages for Reduced SHA-0 and SHA-1
- Preimage Attacks on 3, 4, and 5-Pass HAVAL
- A New Dedicated 256-Bit Hash Function: FORK-256
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More
- RIPEMD-160: A strengthened version of RIPEMD
- Advances in Cryptology – CRYPTO 2004
- Weaknesses in the HAS-V Compression Function
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- A Meet-in-the-Middle Collision Attack Against the New FORK-256