[Resource Topic] 2005/082: Some properties of an FSE 2005 Hash Proposal

Welcome to the resource topic for 2005/082

Some properties of an FSE 2005 Hash Proposal

Authors: Lars R. Knudsen


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.

ePrint: https://eprint.iacr.org/2005/082

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .