[Resource Topic] 2011/238: Attacks On a Double Length Blockcipher-based Hash Proposal

Welcome to the resource topic for 2011/238

Title:
Attacks On a Double Length Blockcipher-based Hash Proposal

Authors: Yiyuan Luo, Xuejia Lai

Abstract:

In this paper we attack a 2n-bit double length hash function proposed by Lee et al. This proposal is a blockcipher-based hash function with hash rate 2/3. The designers claimed that it could achieve ideal collision resistance and gave a security proof. However, we find a collision attack with complexity of \Omega(2^{3n/4}) and a preimage attack with complexity of \Omega(2^{n}). Our result shows this construction is much worse than an ideal 2n-bit hash function.

ePrint: https://eprint.iacr.org/2011/238

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 .