CryptoDB
Some properties of an FSE 2005 Hash Proposal
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12419, title={Some properties of an FSE 2005 Hash Proposal}, booktitle={IACR Eprint archive}, keywords={hash functions}, url={http://eprint.iacr.org/2005/082}, note={ knudsen@mat.dtu.dk 12859 received 17 Mar 2005}, author={Lars R. Knudsen}, year=2005 }