Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
CRYPTO, pp. 306-316, 2004.
In this paper, we study the existence of multicollisions in it- erated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the same value, is not much harder than finding ordinary collisions, i.e. pairs of messages, even for extremely large values of r. More precisely, the ratio of the complexi...More
PPT (Upload PPT)
Best Paper of CRYPTO, 2004