Linear Cryptanalysis of Reduced Round Serpent

  • Authors:
  • Eli Biham;Orr Dunkelman;Nathan Keller

  • Affiliations:
  • -;-;-

  • Venue:
  • FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.