Second Preimages on n-bit Hash Functions for Much Less than 2n Work

By John Kelsey, Bruce Schneier. IACR Cryptology ePrint Archive, 2005

375 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the Indifferentiability of the Sponge Construction (2008, background): “One may ask the question: what does this say about resistance to classical attacks such as collision-resistance, including multicollisions [9], (2nd) preimage resistance, including long-message attacks [10] and herding [11]? In general, it is expected that a hash function offers the same resistance ”
The Skein Hash Function Family (2009, background): “Similarly, we found it is possible to exploit collisions on the internal state of a hash function to find second preimages faster than one might naively otherwise expect [50], and we show how to exploit collisions on the internal state of a hash function to mount what we call “herding” attacks [49].”