Advances in Cryptology – CRYPTO 2013

Volume 8042 of the series Lecture Notes in Computer Science pp 222-240

Sieve-in-the-Middle: Improved MITM Attacks

  • Anne CanteautAffiliated withProject-Team SECRET, Inria Paris-Rocquencourt
  • , María Naya-PlasenciaAffiliated withProject-Team SECRET, Inria Paris-Rocquencourt
  • , Bastien VayssièreAffiliated withUniversité de Versailles Saint-Quentin-en-Yvelines


This paper presents a new generic technique, named sieve-in-the-middle, which improves meet-in-the-middle attacks in the sense that it provides an attack on a higher number of rounds. Instead of selecting the key candidates by searching for a collision in an intermediate state which can be computed forwards and backwards, we look for the existence of valid transitions through some middle sbox. Combining this technique with short bicliques allows to freely add one or two more rounds with the same time complexity. Moreover, when the key size of the cipher is larger than its block size, we show how to build the bicliques by an improved technique which does not require any additional data (on the contrary to previous biclique attacks). These techniques apply to PRESENT, DES, PRINCE and AES, improving the previously known results on these four ciphers. In particular, our attack on PRINCE applies to 8 rounds (out of 12), instead of 6 in the previous cryptanalyses. Some results are also given for theoretically estimating the sieving probability provided by some inputs and outputs of a given sbox.


Meet-in-the-middle bicliques sbox matching algorithms