Some properties of an FSE 2005 Hash Proposal

Lars R.  Knudsen

Paper 2005/082

Some properties of an FSE 2005 Hash Proposal

Lars R. Knudsen

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 PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: hash functions
Contact author(s): knudsen @ mat dtu dk
History: 2005-03-17: received
Short URL: https://ia.cr/2005/082
License: CC BY

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}
}