International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Design Principles for Iterated Hash Functions

Authors:
Stefan Lucks
Download:
URL: http://eprint.iacr.org/2004/253
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12221,
  title={Design Principles for Iterated Hash Functions},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography /},
  url={http://eprint.iacr.org/2004/253},
  note={hash function, Joux attack, provable security, black-box model lucks@th.informatik.uni-mannheim.de 12689 received 28 Sep 2004},
  author={Stefan Lucks},
  year=2004
}