Hash function cryptanalysis has acquired many methods, tools and tricks from other areas, mostly block ciphers. In this paper another trick from block cipher cryptanalysis, the structures, is used for speeding up the collision search. We investigate the memory and the time complexities of this approach under different assumptions on the round functions. The power of the new attack is illustrated with the cryptanalysis of the hash functions Grindahl and the analysis of the SHA-3 candidate Fugue (both functions as 256 and 512 bit versions). The collision attack on Grindahl-512 is the first collision attack on this function. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Khovratovich, D. (2009). Cryptanalysis of hash functions with structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5867 LNCS, pp. 108–125). https://doi.org/10.1007/978-3-642-05445-7_7
Mendeley helps you to discover research relevant for your work.