Advanced Slide Attacks on the Even-Mansour Scheme

Block ciphers have been widely used to protect data security. Most block ciphers (such as AES) have an iterated structure which alternately XOR's a secret key and use some publicly known permutation. In 1991, the simplest example of such a block cipher, called the Even-Mansour (EM) scheme, was defined and analyzed by Even and Mansour. One of the main tools used in previous attacks was the slide attack. In this paper, we firstly show some special instances of the original slide attacks whose success rate is 0. We use this result to illustrate that an assumption of these attacks is not reasonable. Moreover, we present the advanced slide attacks whose success rate is always a non-negligible constant on the Even-Mansour scheme. Finally, we apply this advanced technique to attack the additional Even-Mansour scheme.