New results on boomerang and rectangle attacks

Eli Biham; Orr Dunkelman; Nathan Keller

doi:10.1007/3-540-45661-9_1

New results on boomerang and rectangle attacks

Eli Biham, Orr Dunkelman, Nathan Keller

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

Abstract

The boomerang attack is a newand very powerful cryptanalytic technique. However, due to the adaptive chosen plaintext and ciphertext nature of the attack, boomerang key recovery attacks that retrieve key material on both sides of the boomerang distinguisher are hard to mount.We also present a method for using a boomerang distinguisher, which enables retrieving subkey bits on both sides of the boomerang distinguisher. The rectangle attack evolved from the boomerang attack.In this paper we present a new algorithm which improves the results of the rectangle attack. Using these improvements we can attack 3.5-round SC2000 with 2⁶⁷ adaptive chosen plaintexts and ciphertexts, and 10-round Serpent with time complexity of 2^173.8 memory accesses (which are equivalent to 2^165.3 Serpent encryptions) with data complexity of 2^126.3 chosen plaintexts.

Original language	English
Title of host publication	Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers
Editors	Joan Daemen, Vincent Rijmen
Publisher	Springer Verlag
Pages	1-16
Number of pages	16
ISBN (Print)	9783540440093
DOIs	https://doi.org/10.1007/3-540-45661-9_1
State	Published - 2002
Externally published	Yes
Event	9th International Workshop on Fast Software Encryption, FSE 2002 - Leuven, Belgium Duration: 4 Feb 2002 → 6 Feb 2002

Publication series

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

Conference

Conference	9th International Workshop on Fast Software Encryption, FSE 2002
Country/Territory	Belgium
City	Leuven
Period	4/02/02 → 6/02/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45661-9_1

Cite this

Biham, E., Dunkelman, O., & Keller, N. (2002). New results on boomerang and rectangle attacks. In J. Daemen, & V. Rijmen (Eds.), Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers (pp. 1-16). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2365). Springer Verlag. https://doi.org/10.1007/3-540-45661-9_1

Biham, Eli ; Dunkelman, Orr ; Keller, Nathan. / New results on boomerang and rectangle attacks. Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. editor / Joan Daemen ; Vincent Rijmen. Springer Verlag, 2002. pp. 1-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fad4eca022ad4dd4a47701cfca5d5e62,

title = "New results on boomerang and rectangle attacks",

abstract = "The boomerang attack is a newand very powerful cryptanalytic technique. However, due to the adaptive chosen plaintext and ciphertext nature of the attack, boomerang key recovery attacks that retrieve key material on both sides of the boomerang distinguisher are hard to mount.We also present a method for using a boomerang distinguisher, which enables retrieving subkey bits on both sides of the boomerang distinguisher. The rectangle attack evolved from the boomerang attack.In this paper we present a new algorithm which improves the results of the rectangle attack. Using these improvements we can attack 3.5-round SC2000 with 267 adaptive chosen plaintexts and ciphertexts, and 10-round Serpent with time complexity of 2173.8 memory accesses (which are equivalent to 2165.3 Serpent encryptions) with data complexity of 2126.3 chosen plaintexts.",

author = "Eli Biham and Orr Dunkelman and Nathan Keller",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 9th International Workshop on Fast Software Encryption, FSE 2002 ; Conference date: 04-02-2002 Through 06-02-2002",

year = "2002",

doi = "10.1007/3-540-45661-9_1",

language = "English",

isbn = "9783540440093",

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

publisher = "Springer Verlag",

pages = "1--16",

editor = "Joan Daemen and Vincent Rijmen",

booktitle = "Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers",

address = "Germany",

}

Biham, E, Dunkelman, O & Keller, N 2002, New results on boomerang and rectangle attacks. in J Daemen & V Rijmen (eds), Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2365, Springer Verlag, pp. 1-16, 9th International Workshop on Fast Software Encryption, FSE 2002, Leuven, Belgium, 4/02/02. https://doi.org/10.1007/3-540-45661-9_1

New results on boomerang and rectangle attacks. / Biham, Eli; Dunkelman, Orr; Keller, Nathan.
Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. ed. / Joan Daemen; Vincent Rijmen. Springer Verlag, 2002. p. 1-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2365).

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

TY - GEN

T1 - New results on boomerang and rectangle attacks

AU - Biham, Eli

AU - Dunkelman, Orr

AU - Keller, Nathan

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - The boomerang attack is a newand very powerful cryptanalytic technique. However, due to the adaptive chosen plaintext and ciphertext nature of the attack, boomerang key recovery attacks that retrieve key material on both sides of the boomerang distinguisher are hard to mount.We also present a method for using a boomerang distinguisher, which enables retrieving subkey bits on both sides of the boomerang distinguisher. The rectangle attack evolved from the boomerang attack.In this paper we present a new algorithm which improves the results of the rectangle attack. Using these improvements we can attack 3.5-round SC2000 with 267 adaptive chosen plaintexts and ciphertexts, and 10-round Serpent with time complexity of 2173.8 memory accesses (which are equivalent to 2165.3 Serpent encryptions) with data complexity of 2126.3 chosen plaintexts.

AB - The boomerang attack is a newand very powerful cryptanalytic technique. However, due to the adaptive chosen plaintext and ciphertext nature of the attack, boomerang key recovery attacks that retrieve key material on both sides of the boomerang distinguisher are hard to mount.We also present a method for using a boomerang distinguisher, which enables retrieving subkey bits on both sides of the boomerang distinguisher. The rectangle attack evolved from the boomerang attack.In this paper we present a new algorithm which improves the results of the rectangle attack. Using these improvements we can attack 3.5-round SC2000 with 267 adaptive chosen plaintexts and ciphertexts, and 10-round Serpent with time complexity of 2173.8 memory accesses (which are equivalent to 2165.3 Serpent encryptions) with data complexity of 2126.3 chosen plaintexts.

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

U2 - 10.1007/3-540-45661-9_1

DO - 10.1007/3-540-45661-9_1

M3 - Conference contribution

AN - SCOPUS:84949456804

SN - 9783540440093

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

SP - 1

EP - 16

BT - Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers

A2 - Daemen, Joan

A2 - Rijmen, Vincent

PB - Springer Verlag

T2 - 9th International Workshop on Fast Software Encryption, FSE 2002

Y2 - 4 February 2002 through 6 February 2002

ER -

Biham E, Dunkelman O, Keller N. New results on boomerang and rectangle attacks. In Daemen J, Rijmen V, editors, Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. Springer Verlag. 2002. p. 1-16. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45661-9_1

New results on boomerang and rectangle attacks

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this