(Second) preimage attacks on step-reduced RIPEMD/RIPEMD-128 with a new local-collision approach

  • Authors:
  • Lei Wang;Yu Sasaki;Wataru Komatsubara;Kazuo Ohta;Kazuo Sakiyama

  • Affiliations:
  • The University of Electro-Communications;NTT Corporation;The University of Electro-Communications;The University of Electro-Communications;The University of Electro-Communications

  • Venue:
  • CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper uses new types of local collisions named onemessage-word local collisions to construct meet-in-the-middle preimage attacks on two double-branch hash functions RIPEMD and RIPEMD- 128, and obtains the following results. 1) A pseudo-preimage and second preimage attacks on the first 47 steps of RIPEMD (full version: 48 steps) are proposed with complexities of 2119 and 2124.5 compression function computations, respectively. The number of the attacked steps is greatly increased from previous preimage attacks on the first 33 steps and intermediate 35 steps. 2) A pseudo-preimage and preimage attacks on intermediate 36 steps of RIPEMD-128 (full version: 64 steps) are proposed with complexities of 2123 and 2126.5 compression function computations, respectively, while previous attacks can work at most intermediate 35 steps.