Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings

The authors extend and improve biclique attacks, which were recently introduced for the cryptanalysis of block ciphers and hash functions. While previous attacks required a primitive to have a key or a message schedule, they show how to mount attacks on permutations with fixed or no parameters. To link the new methods with older ones, they introduce the concept of phantom schedule. The new framework allows to convert preimage attacks into collision attacks and derive the first collision attacks on the reduced SHA-3 finalist Skein

Provided by: Microsoft Research Topic: Security Date Added: Mar 2012 Format: PDF

Find By Topic