GenericAttacksMerkleDamgaard

Second Preimage Attacks

John Kelsey, Bruce Schneier - Second Preimages on n-Bit Hash Functions for Much Less than $2^n$ Work.

EUROCRYPT 3494:474-490,2005

http://dx.doi.org/10.1007/11426639_28
Bibtex

Author : John Kelsey, Bruce Schneier
Title : Second Preimages on n-Bit Hash Functions for Much Less than $2^n$ Work.
In : EUROCRYPT -
Address :
Date : 2005

Mridul Nandi, Douglas R. Stinson - {Multicollision Attacks on Some Generalized Sequential Hash

Functions}

IEEE Transactions on Information Theory 53(2):759-767,2007

http://dx.doi.org/10.1109/TIT.2006.889721
Bibtex

Author : Mridul Nandi, Douglas R. Stinson
Title : {Multicollision Attacks on Some Generalized Sequential Hash Functions}
In : IEEE Transactions on Information Theory -
Address :
Date : 2007

Note: This artcle shows that second preimages can be found in much less than 2ⁿ work. This approach works for all iterated hash functions. Nevertheless, this attack is not practical since a huge amount of data is required.

---