Differential-linear cryptanalysis of serpent

41Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

Abstract

Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant. In this paper we apply the enhanced differential-linear cryptanalysis to Serpent. The resulting attack is the best known attack on 11-round Serpent. It requires 2125.3 chosen plaintexts and has time complexity of 2139.2. We also present the first known attack on 10-round 128-bit key Serpent. These attacks demonstrate the strength of the enhanced differential-linear cryptanalysis technique. © International Association for Cryptologic Research 2003.

Cite

CITATION STYLE

APA

Biham, E., Dunkelman, O., & Keller, N. (2003). Differential-linear cryptanalysis of serpent. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2887, 9–21. https://doi.org/10.1007/978-3-540-39887-5_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free