Welcome to the resource topic for 2009/120
Title:
On the Complexity of Khovratovich et.al’s Preimage Attack on Edon-R
Authors: Danilo Gligoroski, 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.
ePrint: https://eprint.iacr.org/2009/120
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 .