Differential-linear cryptanalysis of serpent

Eli Biham; Orr Dunkelman; Nathan Keller

doi:10.1007/978-3-540-39887-5_2

Differential-linear cryptanalysis of serpent

Eli Biham, Orr Dunkelman, Nathan Keller

Research output: Contribution to journal › Article › peer-review

Abstract

Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant. In this paper we apply the enhanced differential-linear cryptanalysis to Serpent. The resulting attack is the best known attack on 11-round Serpent. It requires 2^125.3 chosen plaintexts and has time complexity of 2^139.2. We also present the first known attack on 10-round 128-bit key Serpent. These attacks demonstrate the strength of the enhanced differential-linear cryptanalysis technique.

Original language	English
Pages (from-to)	9-21
Number of pages	13
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2887
DOIs	https://doi.org/10.1007/978-3-540-39887-5_2
State	Published - 2003
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-39887-5_2

Cite this

@article{f1b3bae72d5742089f1b883963e84e12,

title = "Differential-linear cryptanalysis of serpent",

abstract = "Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant. In this paper we apply the enhanced differential-linear cryptanalysis to Serpent. The resulting attack is the best known attack on 11-round Serpent. It requires 2125.3 chosen plaintexts and has time complexity of 2139.2. We also present the first known attack on 10-round 128-bit key Serpent. These attacks demonstrate the strength of the enhanced differential-linear cryptanalysis technique.",

author = "Eli Biham and Orr Dunkelman and Nathan Keller",

year = "2003",

doi = "10.1007/978-3-540-39887-5_2",

language = "English",

volume = "2887",

pages = "9--21",

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

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

T1 - Differential-linear cryptanalysis of serpent

AU - Biham, Eli

AU - Dunkelman, Orr

AU - Keller, Nathan

PY - 2003

Y1 - 2003

N2 - Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant. In this paper we apply the enhanced differential-linear cryptanalysis to Serpent. The resulting attack is the best known attack on 11-round Serpent. It requires 2125.3 chosen plaintexts and has time complexity of 2139.2. We also present the first known attack on 10-round 128-bit key Serpent. These attacks demonstrate the strength of the enhanced differential-linear cryptanalysis technique.

AB - Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant. In this paper we apply the enhanced differential-linear cryptanalysis to Serpent. The resulting attack is the best known attack on 11-round Serpent. It requires 2125.3 chosen plaintexts and has time complexity of 2139.2. We also present the first known attack on 10-round 128-bit key Serpent. These attacks demonstrate the strength of the enhanced differential-linear cryptanalysis technique.

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

U2 - 10.1007/978-3-540-39887-5_2

DO - 10.1007/978-3-540-39887-5_2

M3 - Article

AN - SCOPUS:0242404246

SN - 0302-9743

VL - 2887

SP - 9

EP - 21

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

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

ER -

Differential-linear cryptanalysis of serpent

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this