Linear cryptanalysis of reduced round serpent

Eli Biham, Orr Dunkelman, Nathan Keller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationFast Software Encryption - 8th International Workshop, FSE 2001, Revised Papers
EditorsMitsuru Matsui
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540438696, 9783540438694
StatePublished - 2002
Externally publishedYes
Event8th International Workshop on Fast Software Encryption, FSE 2001 - Yokohama, Japan
Duration: 2 Apr 20014 Apr 2001

Publication series

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


Conference8th International Workshop on Fast Software Encryption, FSE 2001

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2002.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Linear cryptanalysis of reduced round serpent'. Together they form a unique fingerprint.

Cite this