Cryptology ePrint Archive: Report 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.

Category / Keywords: hash functions

Date: received 17 Mar 2005

Contact author: knudsen at mat dtu dk

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050317:144849 (All versions of this report)

Discussion forum: Show discussion | Start new discussion