Cryptology ePrint Archive: Report 2010/423

Near Collisions for the Compress Function of Hamsi-256 Found by Genetic Algorithm

LI Yun-qiang and Wang Ai-lan

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 1/2^24, 1/2^23 respectively, which are better than previous work reported about near collisions.

Category / Keywords: foundations /

Date: received 30 Jul 2010, last revised 30 Jul 2010

Contact author: yunqiangli at 126 com

Available format(s): PDF | BibTeX Citation

Version: 20100731:023806 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]