Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials (1999) [59 citations — 12 self]
by Eli Biham, Alex Biryukov, Adi Shamir
http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/1998/CS/CS0947.ps.gz
Add To MetaCart
Abstract:
Abstract. In this paper we present a new cryptanalytic technique, based on impossible differentials, and use it to show that Skipjack reduced from 32 to 31 rounds can be broken by an attack which is faster than exhaustive search.
Citations
| 292 | cryptanalysis method for DES cipher, in – Matsui, Linear - 1994 |
| 265 | Differential Cryptanalysis of the Data Encryption Standard – Biham, Shamir - 1993 |
| 34 | Fast Software Encryption Functions – Merkle - 1990 |
| 11 | Differential Cryptanalysis of Lucifer – Ben-Aroya, Biham - 1994 |
| 8 | Fast Data Encryption Algorithm FEAL – Shimizu, Miyaguchi - 1987 |
| 6 | Fast Data Encryption Algorithm FEAL-8, Review of electrical communications laboratories – Miyaguchi, Shiraishi, et al. - 1988 |
| 4 | The CAST-256 Encryption Algorithm, AES submission, available at http://www.entrust.com/resources/pdf/cast-256.pdf – Adams - 1998 |
| 3 | Further Attacks on 16 Rounds of SkipJack, private communication – Wagner - 1998 |
| 2 | A 128-bit Block Cipher, AES submission, available at http://www.ii.uib.no/��larsr/papers/deal.ps – Knudsen, DEAL - 1998 |
| 1 | Cryptanalysis of Ladder-DES, proceedings of Fast Software Encryption – Biham - 1997 |

