|
MD5 is a hash function proposed by Rivest in 1992 [2]. In 2004, two-block collisions of MD5 were presented by Wang et al [8]. This paper builds on the work presented in Ref [8-10]. In this paper, firstly we discuss the sufficient conditions for keeping desired differential path. By analyzing the expanding of subtraction difference, differential characters of Boolean functions, and the differential characters of shift rotation, the sufficient conditions for keeping desired differential path could be obtained. From the differential characters of shift rotation, we find the lacked sufficient conditions in Ref [10]. Then we present an algorithm that reduces the number of trials for finding collisions. |
|
Keywords:MD5; differential attacks; collision |
|