Paper 2011/238 Original: eprint.iacr.org/2011/238 ↗
Attacks On a Double Length Blockcipher-based Hash Proposal
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2016-08-19: last updated
- 2011-05-18: published
- Short URL
- https://ia.cr/2011/238
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/238,
author = {Yiyuan Luo and Xuejia Lai},
title = {Attacks On a Double Length Blockcipher-based Hash Proposal},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/238},
year = {2011},
url = {https://eprint.iacr.org/2011/238}
}