Paper 2005/082 Original: eprint.iacr.org/2005/082 ↗
Some properties of an FSE 2005 Hash Proposal
Abstract
We consider the hash function proposals by Mridul et al.\ presented at FSE 2005. For the proposed $2n$-bit compression functions it is proved that collision attacks require $\Omega(2^{2n/3})$ queries of the functions in question. In this note it is shown that with ${\cal O}(2^{n/3})$ queries one can distinguish the proposed compression functions from a randomly chosen $2n$-bit function with very good probability. Finally we note that our results do not seem to contradict any statements made the designers of the compression functions.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2005-03-17: last updated
- 2005-03-17: published
- Short URL
- https://ia.cr/2005/082
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/082,
author = {Lars R. Knudsen},
title = {Some properties of an FSE 2005 Hash Proposal},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/082},
year = {2005},
url = {https://eprint.iacr.org/2005/082}
}