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

Danilo Gligoroski; Rune Steinsmo Ødegård

Paper 2009/120

On the Complexity of Khovratovich et.al'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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: sha-3 Edon-R hash function
Contact author(s): danilog @ item ntnu no
History: 2009-03-15: received
Short URL: https://ia.cr/2009/120
License: CC BY

BibTeX

@misc{cryptoeprint:2009/120,
      author = {Danilo Gligoroski and Rune Steinsmo Ødegård},
      title = {On the Complexity of Khovratovich et.al's Preimage Attack on Edon-R},
      howpublished = {Cryptology ePrint Archive, Paper 2009/120},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/120}},
      url = {https://eprint.iacr.org/2009/120}
}