@inbook{3e589a2f6766474a9804394e699adaed,

title = "Orr Dunkelman",

abstract = "Differential cryptanalysis analyzes ciphers by studying the development of differences during encryption. Linear cryptanalysis is similar but is based on studying approximate linear relations. In 1994, Langford and Hellman showed that both kinds of analysis can be combined together by a technique called differential-linear cryptanalysis, in which the differential part creates a linear approximation with probability 1. They applied their technique to 8-round DES. In this paper we present an enhancement of differential-linear cryptanalysis in which the inherited linear probability is smaller than 1. We use this extension to describe a differential-linear distinguisher for a 7-round reduced-version of DES, and to present the best known key-recovery attack on a 9-round reduced-version of DES. We use our enhanced technique to attack COCONUT98 with time complexity 233.7 encryptions and 227.7 chosen plaintexts.",

author = "Eli Biham and Orr Dunkelman and N. Keller",

year = "2002",

language = "American English",

volume = "2501",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "254--266",

editor = "Yuliang Zheng",

booktitle = "Advances in Cryptology — ASIACRYPT 2002",

}