Linear Cryptanalysis of Reduced Round Serpent

Eli Biham, Orr Dunkelman, N. Keller

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-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 languageAmerican English
Title of host publicationFast Software Encryption
EditorsMitsuru Matsui
Place of PublicationBerlin Heidelberg
PublisherSpringer
Pages16-27
Volume2355
StatePublished - 2002

Publication series

NameLecture Notes in Computer Science

Fingerprint

Dive into the research topics of 'Linear Cryptanalysis of Reduced Round Serpent'. Together they form a unique fingerprint.

Cite this