Loading [a11y]/accessibility-menu.js
Using genetic algorithm to find near collisions for the compress function of Hamsi-256 | IEEE Conference Publication | IEEE Xplore

Using genetic algorithm to find near collisions for the compress function of Hamsi-256


Abstract:

Hamsi is one of 14 remaining candidates in NIST's Hash Competition for the future hash standard SHA-3 and Hamsi-256 is one of four kinds of Hamsi. In this paper we presen...Show More

Abstract:

Hamsi is one of 14 remaining candidates in NIST's Hash Competition for the future hash standard SHA-3 and Hamsi-256 is one of four kinds of Hamsi. In this paper we present a genetic algorithm to search near collisions for the compress function of Hamsi-256, give a near collision on (256 - 20) bits and a near collision on (256 - 21) bits with four differences in the chaining value, and obtain a differential path for three rounds of Hamsi-256 with probability 2−24, 2−23 respectively, which are better than previous work reported about near collisions.
Date of Conference: 23-26 September 2010
Date Added to IEEE Xplore: 29 November 2010
ISBN Information:
Conference Location: Changsha, China

Contact IEEE to Subscribe

References

References is not available for this document.