Design Principles for Iterated Hash Functions

Stefan Lucks

Paper 2004/253

Design Principles for Iterated Hash Functions

Stefan Lucks

Abstract

This paper deals with the security of iterated hash functions against generic attacks, such as, e.g., Joux' multicollision attacks from Crypto 04. The core idea is to increase the size of the internal state of an n-bit hash function to w > n bit. Variations of this core idea allow the use of a compression function with n output bits, even if the compression function itself is based on a block cipher. In a formal model, it is shown that these modifications quantifiably improve the security of iterated hash functions against generic attacks.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. hash function, Joux attack, provable security, black-box model
Contact author(s): lucks @ th informatik uni-mannheim de
History: 2004-09-29: received
Short URL: https://ia.cr/2004/253
License: CC BY

BibTeX

@misc{cryptoeprint:2004/253,
      author = {Stefan Lucks},
      title = {Design Principles for Iterated Hash Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2004/253},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/253}},
      url = {https://eprint.iacr.org/2004/253}
}