A differential-linear attack on 12-round serpent

Orr Dunkelman; Sebastiaan Indesteege; Nathan Keller

doi:10.1007/978-3-540-89754-5_24

A differential-linear attack on 12-round serpent

Orr Dunkelman, Sebastiaan Indesteege, Nathan Keller

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher. In this paper we introduce a more accurate analysis of the differential-linear attack on 11-round Serpent. The analysis involves both theoretical aspects as well as experimental results which suggest that previous attacks had overestimated complexities. Following our findings we are able to suggest an improved 11-round attack with a lower data complexity. Using the new results, we are able to devise the first known attack on 12-round Serpent.

Original language	English
Title of host publication	Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings
Pages	308-321
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-540-89754-5_24
State	Published - 2008
Externally published	Yes
Event	9th International Conference on Cryptology in India, INDOCRYPT 2008 - Kharagpur, India Duration: 14 Dec 2008 → 17 Dec 2008

Publication series

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

Conference

Conference	9th International Conference on Cryptology in India, INDOCRYPT 2008
Country/Territory	India
City	Kharagpur
Period	14/12/08 → 17/12/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-89754-5_24

Cite this

Dunkelman, O., Indesteege, S., & Keller, N. (2008). A differential-linear attack on 12-round serpent. In Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings (pp. 308-321). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5365 LNCS). https://doi.org/10.1007/978-3-540-89754-5_24

Dunkelman, Orr ; Indesteege, Sebastiaan ; Keller, Nathan. / A differential-linear attack on 12-round serpent. Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings. 2008. pp. 308-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7f665417e58d42228d91baa62ca2a390,

title = "A differential-linear attack on 12-round serpent",

abstract = "Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher. In this paper we introduce a more accurate analysis of the differential-linear attack on 11-round Serpent. The analysis involves both theoretical aspects as well as experimental results which suggest that previous attacks had overestimated complexities. Following our findings we are able to suggest an improved 11-round attack with a lower data complexity. Using the new results, we are able to devise the first known attack on 12-round Serpent.",

author = "Orr Dunkelman and Sebastiaan Indesteege and Nathan Keller",

year = "2008",

doi = "10.1007/978-3-540-89754-5_24",

language = "English",

isbn = "3540897534",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "308--321",

booktitle = "Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings",

note = "9th International Conference on Cryptology in India, INDOCRYPT 2008 ; Conference date: 14-12-2008 Through 17-12-2008",

}

Dunkelman, O, Indesteege, S & Keller, N 2008, A differential-linear attack on 12-round serpent. in Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5365 LNCS, pp. 308-321, 9th International Conference on Cryptology in India, INDOCRYPT 2008, Kharagpur, India, 14/12/08. https://doi.org/10.1007/978-3-540-89754-5_24

A differential-linear attack on 12-round serpent. / Dunkelman, Orr; Indesteege, Sebastiaan; Keller, Nathan.
Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings. 2008. p. 308-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5365 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A differential-linear attack on 12-round serpent

AU - Dunkelman, Orr

AU - Indesteege, Sebastiaan

AU - Keller, Nathan

PY - 2008

Y1 - 2008

N2 - Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher. In this paper we introduce a more accurate analysis of the differential-linear attack on 11-round Serpent. The analysis involves both theoretical aspects as well as experimental results which suggest that previous attacks had overestimated complexities. Following our findings we are able to suggest an improved 11-round attack with a lower data complexity. Using the new results, we are able to devise the first known attack on 12-round Serpent.

AB - Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher. In this paper we introduce a more accurate analysis of the differential-linear attack on 11-round Serpent. The analysis involves both theoretical aspects as well as experimental results which suggest that previous attacks had overestimated complexities. Following our findings we are able to suggest an improved 11-round attack with a lower data complexity. Using the new results, we are able to devise the first known attack on 12-round Serpent.

UR - http://www.scopus.com/inward/record.url?scp=58549106840&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89754-5_24

DO - 10.1007/978-3-540-89754-5_24

M3 - Conference contribution

AN - SCOPUS:58549106840

SN - 3540897534

SN - 9783540897538

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 308

EP - 321

BT - Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings

T2 - 9th International Conference on Cryptology in India, INDOCRYPT 2008

Y2 - 14 December 2008 through 17 December 2008

ER -

Dunkelman O, Indesteege S, Keller N. A differential-linear attack on 12-round serpent. In Progress in Cryptology - INDOCRYPT 2008 - 9th International Conference on Cryptology in India, Proceedings. 2008. p. 308-321. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-89754-5_24

A differential-linear attack on 12-round serpent

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this