Paper 2009/120

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

Danilo Gligoroski and Rune Steinsmo \O deg\aa 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.