Paper 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
yunqiangli @ 126 com
History
2010-07-31: received
Short URL
https://ia.cr/2010/423
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/423,
      author = {LI Yun-qiang and Wang Ai-lan},
      title = {Near Collisions for the Compress Function of Hamsi-256 Found by Genetic Algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2010/423},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/423}},
      url = {https://eprint.iacr.org/2010/423}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.