Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography /

Publication Info: hash function, Joux attack, provable security, black-box model

Date: received 28 Sep 2004

Contact author: lucks at th informatik uni-mannheim de

Available format(s): PDF | BibTeX Citation

Version: 20040929:003615 (All versions of this report)

Short URL: ia.cr/2004/253