Hash Functions and the (Amplified) Boomerang Attack

9 years 7 months ago
Hash Functions and the (Amplified) Boomerang Attack
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered secure collision free hash functions. These attacks use classical cryptographic techniques from block cipher analysis such as differential cryptanalysis together with some specific methods. Among those, we can cite the neutral bits of Biham and Chen or the message modification techniques of Wang et al. In this paper, we show that another tool of block cipher analysis, the boomerang attack, can also be used in this context. In particular, we show that using this boomerang attack as a neutral bits tool, it becomes possible to lower the complexity of the
Antoine Joux, Thomas Peyrin
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2007
Authors Antoine Joux, Thomas Peyrin
Comments (0)