Finding Second Preimages of Short Messages for Hamsi-256

  • Thomas Fuhr
Conference paper

DOI: 10.1007/978-3-642-17373-8_2

Volume 6477 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Fuhr T. (2010) Finding Second Preimages of Short Messages for Hamsi-256. In: Abe M. (eds) Advances in Cryptology - ASIACRYPT 2010. ASIACRYPT 2010. Lecture Notes in Computer Science, vol 6477. Springer, Berlin, Heidelberg


In this paper we study the second preimage resistance of Hamsi-256, a second round SHA-3 candidate. We show that it is possible to find affine equations between some input bits and some output bits on the 3-round compression function. This property enables an attacker to find pseudo preimages for the Hamsi-256 compression function. The pseudo preimage algorithm can be used to find second preimages of the digests of messages M with complexity 2251.3, which is lower than the best generic attacks when M is short.


hash functions Hamsi second preimage 
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2010

Authors and Affiliations

  • Thomas Fuhr
    • 1
    • 2
  1. 1.ANSSIParisFrance
  2. 2.TELECOM-ParisTechParisFrance