Hans Dobbertin,Antoon Bosselaers和Bart Preneel在1996年提出hash函数RIPEMD-128,它包含两个独立并行的部分,每一部分的输出组合成RIPEMD-128的输出结果.给出前32步RIPEMD-128的碰撞实例,其计算复杂度是2^28次32-步RIPEMD-128运算.本文是对前32步RIPEMD-128分析的第一次公开.
RIPEMD-128 is a cryptographic hash function proposed in 1996 by Hans Dobbertin, Antoon Bosselaers and Bart Preneel. It consists of two different and independent parallel parts, with which the results in each application of the compression function. This paper presents a practical attack for finding collisions for the first 32-step reduced RIPEMD-128 with complexity of 2^28 32-step reduced RIPEMD-128 operations. This is the first published analysis for the first 32-step reduced RIPEMD- 128.