Paper 2011/238

Attacks On a Double Length Blockcipher-based Hash Proposal

Yiyuan Luo and 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.

Note: Accepted by Cryptography and Communications, 2015

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown status
Keywords
Blockcipher-basedhash functions
Contact author(s)
luoyiyuan @ gmail com
History
2016-08-19: revised
2011-05-18: received
See all versions
Short URL
https://ia.cr/2011/238
License
Creative Commons Attribution
CC BY

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}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.