Practical Near-Collisions for Reduced Round Blake , Fugue , Hamsi and JH Meltem

@inproceedings{Turan2010PracticalNF,
  title={Practical Near-Collisions for Reduced Round Blake , Fugue , Hamsi and JH Meltem},
  author={S{\"o}nmez Turan and Erdener Uyan},
  year={2010}
}
A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only a small number of bits. In this study, we use hill climbing methods to evaluate the nearcollision resistance of some of the round SHA-3 candidates. We practi­ cally obtained (i) 184/256-bit near-collision for the 2-round compression function of Blake-32; (ii) 192/256-bit near-collision for the 2-round com­ pression function of Hamsi-256; (iii) 820/1024-bit near-collisions for 10… CONTINUE READING