(Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach

DOI10.1007/978-3-642-19074-2_14zbMath1284.94123OpenAlexW2105156354MaRDI QIDQ3073708

Kazuo Ohta, Yu Sasaki, Wataru Komatsubara, K. Sakiyama, Lei Wang

Publication date: 11 February 2011

Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_14

zbMATH Keywords

RIPEMDRIPEMD-128Meet-in-the-MiddleOne-Message-Word Local Collision

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ 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} ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing

Cites Work

• Preimage Attacks on Step-Reduced RIPEMD-128 and RIPEMD-160
• Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
• Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
• MD4 is Not One-Way
• Finding Preimages in Full MD5 Faster Than Exhaustive Search
• Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others
• Preimage Attacks on One-Block MD4, 63-Step MD5 and More
• Preimages for Step-Reduced SHA-2
• RIPEMD-160: A strengthened version of RIPEMD
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• A Meet-in-the-Middle Collision Attack Against the New FORK-256
• Second Preimage Attacks on Dithered Hash Functions

This page was built for publication: (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach