|Title||Algebraic and slide attacks on KeeLoq.|
|Author(s)|| Gregory V. Bard, Nicolas T. Courtois, Wilson David|
|Type||Book, Chapter in Book, Conference Proceeding|
|Abstract||In this paper we present several distinct attacks on KeeLoq, each of them is interesting for different reasons. First we show that when about 232 known plaintexts are available, KeeLoq is very weak and for example for 30% of all keys the full key can be recovered with complexity of 228 KeeLoq encryptions. Then we turn our attention to algebraic attacks with the major challenge of breaking KeeLoq given potentially a very small number of known plaintexts.|
Our best “direct” algebraic attack can break up to 160 rounds of KeeLoq. Much better results are achieved in combination with slide attacks. Given about 216 known plaintexts, we present a slide-algebraic attack that uses a SAT solver with the complexity equivalent to about 253 KeeLoq encryptions. To the best of our knowledge, this is the first time that a full-round real-life block cipher is broken using an algebraic attack.
|Keywords||block ciphers, unbalanced Feistel ciphers, slide attacks|