Linear cryptanalysis of reduced round serpent

Eli Biham; Orr Dunkelman; Nathan Keller

doi:10.1007/3-540-45473-X_2

Linear cryptanalysis of reduced round serpent

Eli Biham, Orr Dunkelman, Nathan Keller

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

Abstract

Serpent is one of the 5 AES finalists. In this paper we present a 9-round linear approximation for Serpent with probability of 1/2+2−52. We use it to attack 10-round Serpent with all key lengths with data complexity of 2118 and running time of 289. A variant of this approximation is used in the first attack against an 11-round Serpent with 192-bit and 256-bit keys, which require the same amount of data and 2187 running time.

Original language	English
Title of host publication	Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers
Editors	Mitsuru Matsui
Publisher	Springer Verlag
Pages	16-27
Number of pages	12
ISBN (Print)	3540438696, 9783540438694
DOIs	https://doi.org/10.1007/3-540-45473-X_2
State	Published - 2002
Externally published	Yes
Event	8th International Workshop on Fast Software Encryption, FSE 2001 - Yokohama, Japan Duration: 2 Apr 2001 → 4 Apr 2001

Publication series

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

Conference

Conference	8th International Workshop on Fast Software Encryption, FSE 2001
Country/Territory	Japan
City	Yokohama
Period	2/04/01 → 4/04/01

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45473-X_2

Cite this

Biham, E., Dunkelman, O., & Keller, N. (2002). Linear cryptanalysis of reduced round serpent. In M. Matsui (Ed.), Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers (pp. 16-27). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2355). Springer Verlag. https://doi.org/10.1007/3-540-45473-X_2

Biham, Eli ; Dunkelman, Orr ; Keller, Nathan. / Linear cryptanalysis of reduced round serpent. Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers. editor / Mitsuru Matsui. Springer Verlag, 2002. pp. 16-27 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{070ee86a347b4b7e9a4a7c563bd89ad5,

title = "Linear cryptanalysis of reduced round serpent",

abstract = "Serpent is one of the 5 AES finalists. In this paper we present a 9-round linear approximation for Serpent with probability of 1/2+2−52. We use it to attack 10-round Serpent with all key lengths with data complexity of 2118 and running time of 289. A variant of this approximation is used in the first attack against an 11-round Serpent with 192-bit and 256-bit keys, which require the same amount of data and 2187 running time.",

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

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2002.; 8th International Workshop on Fast Software Encryption, FSE 2001 ; Conference date: 02-04-2001 Through 04-04-2001",

year = "2002",

doi = "10.1007/3-540-45473-X_2",

language = "English",

isbn = "3540438696",

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

publisher = "Springer Verlag",

pages = "16--27",

editor = "Mitsuru Matsui",

booktitle = "Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers",

address = "Germany",

}

Biham, E, Dunkelman, O & Keller, N 2002, Linear cryptanalysis of reduced round serpent. in M Matsui (ed.), Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2355, Springer Verlag, pp. 16-27, 8th International Workshop on Fast Software Encryption, FSE 2001, Yokohama, Japan, 2/04/01. https://doi.org/10.1007/3-540-45473-X_2

Linear cryptanalysis of reduced round serpent. / Biham, Eli; Dunkelman, Orr; Keller, Nathan.
Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers. ed. / Mitsuru Matsui. Springer Verlag, 2002. p. 16-27 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2355).

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

TY - GEN

T1 - Linear cryptanalysis of reduced round serpent

AU - Biham, Eli

AU - Dunkelman, Orr

AU - Keller, Nathan

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2002.

PY - 2002

Y1 - 2002

N2 - Serpent is one of the 5 AES finalists. In this paper we present a 9-round linear approximation for Serpent with probability of 1/2+2−52. We use it to attack 10-round Serpent with all key lengths with data complexity of 2118 and running time of 289. A variant of this approximation is used in the first attack against an 11-round Serpent with 192-bit and 256-bit keys, which require the same amount of data and 2187 running time.

AB - Serpent is one of the 5 AES finalists. In this paper we present a 9-round linear approximation for Serpent with probability of 1/2+2−52. We use it to attack 10-round Serpent with all key lengths with data complexity of 2118 and running time of 289. A variant of this approximation is used in the first attack against an 11-round Serpent with 192-bit and 256-bit keys, which require the same amount of data and 2187 running time.

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

U2 - 10.1007/3-540-45473-X_2

DO - 10.1007/3-540-45473-X_2

M3 - Conference contribution

AN - SCOPUS:84958977353

SN - 3540438696

SN - 9783540438694

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

SP - 16

EP - 27

BT - Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers

A2 - Matsui, Mitsuru

PB - Springer Verlag

T2 - 8th International Workshop on Fast Software Encryption, FSE 2001

Y2 - 2 April 2001 through 4 April 2001

ER -

Biham E, Dunkelman O, Keller N. Linear cryptanalysis of reduced round serpent. In Matsui M, editor, Fast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers. Springer Verlag. 2002. p. 16-27. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45473-X_2

Linear cryptanalysis of reduced round serpent

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this