Enhancing differential-linear cryptanalysis

Eli Biham; Orr Dunkelman; Nathan Keller

doi:10.1007/3-540-36178-2_16

Enhancing differential-linear cryptanalysis

Eli Biham, Orr Dunkelman, Nathan Keller

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Differential cryptanalysis analyzes ciphers by studyingthe development of differences duringencryption. Linear cryptanalysis is similar but is based on studyingappro ximate 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 reducedversion 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.

Original language	English
Title of host publication	Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Editors	Yuliang Zheng
Publisher	Springer Verlag
Pages	254-266
Number of pages	13
ISBN (Print)	3540001719, 9783540001713
DOIs	https://doi.org/10.1007/3-540-36178-2_16
State	Published - 2002
Externally published	Yes
Event	8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002 - Queenstown, New Zealand Duration: 1 Dec 2002 → 5 Dec 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2501
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002
Country/Territory	New Zealand
City	Queenstown
Period	1/12/02 → 5/12/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-36178-2_16

Cite this

Biham, E., Dunkelman, O., & Keller, N. (2002). Enhancing differential-linear cryptanalysis. In Y. Zheng (Ed.), Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 254-266). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2501). Springer Verlag. https://doi.org/10.1007/3-540-36178-2_16

Biham, Eli ; Dunkelman, Orr ; Keller, Nathan. / Enhancing differential-linear cryptanalysis. Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. editor / Yuliang Zheng. Springer Verlag, 2002. pp. 254-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6352969da48b42109ca67677133d9466,

title = "Enhancing differential-linear cryptanalysis",

abstract = "Differential cryptanalysis analyzes ciphers by studyingthe development of differences duringencryption. Linear cryptanalysis is similar but is based on studyingappro ximate 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 reducedversion 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 Nathan Keller",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002 ; Conference date: 01-12-2002 Through 05-12-2002",

year = "2002",

doi = "10.1007/3-540-36178-2_16",

language = "English",

isbn = "3540001719",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "254--266",

editor = "Yuliang Zheng",

booktitle = "Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

address = "Germany",

}

Biham, E, Dunkelman, O & Keller, N 2002, Enhancing differential-linear cryptanalysis. in Y Zheng (ed.), Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2501, Springer Verlag, pp. 254-266, 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002, Queenstown, New Zealand, 1/12/02. https://doi.org/10.1007/3-540-36178-2_16

Enhancing differential-linear cryptanalysis. / Biham, Eli; Dunkelman, Orr; Keller, Nathan.
Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. ed. / Yuliang Zheng. Springer Verlag, 2002. p. 254-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2501).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Enhancing differential-linear cryptanalysis

AU - Biham, Eli

AU - Dunkelman, Orr

AU - Keller, Nathan

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - Differential cryptanalysis analyzes ciphers by studyingthe development of differences duringencryption. Linear cryptanalysis is similar but is based on studyingappro ximate 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 reducedversion 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.

AB - Differential cryptanalysis analyzes ciphers by studyingthe development of differences duringencryption. Linear cryptanalysis is similar but is based on studyingappro ximate 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 reducedversion 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.

UR - http://www.scopus.com/inward/record.url?scp=84958778154&partnerID=8YFLogxK

U2 - 10.1007/3-540-36178-2_16

DO - 10.1007/3-540-36178-2_16

M3 - Conference contribution

AN - SCOPUS:84958778154

SN - 3540001719

SN - 9783540001713

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 254

EP - 266

BT - Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Zheng, Yuliang

PB - Springer Verlag

T2 - 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002

Y2 - 1 December 2002 through 5 December 2002

ER -

Biham E, Dunkelman O, Keller N. Enhancing differential-linear cryptanalysis. In Zheng Y, editor, Advances in Cryptology - ASIACRYPT 2002 - 8th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 2002. p. 254-266. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36178-2_16

Enhancing differential-linear cryptanalysis

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this