Welcome to the resource topic for 2004/253
Title:
Design Principles for Iterated Hash Functions
Authors: 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.
ePrint: https://eprint.iacr.org/2004/253
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .