Cryptology ePrint Archive: Report 2009/120

On the Complexity of Khovratovich's Preimage Attack on Edon-R

Danilo Gligoroski and Rune Steinsmo Ø degå rd

Abstract: Based on the analysis made by van Oorschot and Wiener for the complexity of parallel memoryless collision search, we show that the memoryless meet-in-the-middle attack which is one part of the whole preimage attack of Khovratovich et. al. on Edon-R hash function has complexity bigger than 2^n.

Category / Keywords: sha-3, Edon-R, hash function

Date: received 12 Mar 2009

Contact author: danilog at item ntnu no

Available format(s): PDF | BibTeX Citation

Version: 20090315:021332 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]