Chapter

Fast Software Encryption

Volume 2355 of the series Lecture Notes in Computer Science pp 16-27

Date:

Linear Cryptanalysis of Reduced Round Serpent

  • Eli BihamAffiliated withComputer Science Department, Technion - Israel Institute of Technology
  • , Orr DunkelmanAffiliated withComputer Science Department, Technion - Israel Institute of Technology
  • , Nathan KellerAffiliated withMathematics Department, Technion - Israel Institute of Technology

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.