A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only small number of bits. In this study, we used hill climbing methods to find near-collisions for some of the second round SHA-3 candidates. We practically obtained (i) 72-bit near-collision for the 2-round compression function of Blake-32; (ii) 64-bit near-collision for the 2-round compression function of Hamsi-256; (iii) 212-bit near-collisions for 10-round compression function of JH. For the reduced versions of F-256 function in Fugue, collisions and near collisions are observed.
Conference Dates: August 23-24, 2010
Conference Location: Santa Barbara, CA
Conference Title: The Second SHA-3 Candidate Conference
Pub Type: Conferences
Hash functions, Near-collisions, SHA-3 Competition