A new one-bit difference collision attack on HAVAL-128

In this paper, we give a new fast attack on HAVAL-128. Our attack includes many present methods of constructing hash collisions. Moreover, we present a neighborhood modification. We propose a new difference path different from the previous ones. The conclusion is that, when the output of each step satisfies our condition, the message m can collide with m' = m+Delta m, where Delta m = (0, 0, 0, 0, 2(31), 0, ..., 0). There is only one bit difference between m and m'. Two pairs of collision examples for HAVAL-128 are given. In order to improve the probability of collision, we use four tricks of message modification. The attack's running time is less than 2(25.83) 2-pass HAVAL computations, which is the best result for one-bit collision of HAVAL so far.