Improved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grøstl

Jian Zou; Wenling Wu; Shuang Wu; Le Dong

Paper 2012/686

Improved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grøstl

Jian Zou, Wenling Wu, Shuang Wu, and Le Dong

Abstract

Grøstl is one of the five finalists in the third round of SHA-3 competition hosted by NIST. In this paper, we use many techniques to improve the pseudo preimage attack on Grøstl hash function, such as subspace preimage attack and guess-and-determine technique. We present improved pseudo preimage attacks on 5-round Grøstl-256 and 8-round Grøstl-512 respectively. The complexity of the above two attacks are () (in time and memory) and () respectively. Furthermore, we propose pseudo preimage attack and pseudo second preimage attack on 6-round Grøstl-256. The complexity of our 6-round pseudo preimage and second preimage attack is () and () respectively. As far as we know, these are the best known attacks on round-reduced Grøstl hash function.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Grøstl meet-in-the-middle guess-and-determine
Contact author(s): zoujian @ is iscas ac cn
History: 2012-12-10: revised; 2012-12-10: received; See all versions
Short URL: https://ia.cr/2012/686
License: CC BY

BibTeX

@misc{cryptoeprint:2012/686,
      author = {Jian Zou and Wenling Wu and Shuang Wu and Le Dong},
      title = {Improved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grøstl},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/686},
      year = {2012},
      url = {https://eprint.iacr.org/2012/686}
}