The related-key rectangle attack - Application to SHACAL-1

Jongsung Kim; Guil Kim; Seokhie Hong; Sangjin Lee; Dowon Hong

doi:10.1007/978-3-540-27800-9_11

The related-key rectangle attack - Application to SHACAL-1

Jongsung Kim, Guil Kim, Seokhie Hong, Sangjin Lee, Dowon Hong

Research output: Chapter in Book/Report/Conference proceeding › Chapter

58 Citations (Scopus)

Abstract

The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of 2^149.72 chosen plaintexts and a time complexity of 2^498.30 encryptions, which is faster than exhaustive search.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Huaxiong Wang, Josef Pieprzyk, Vijay Varadharajan
Publisher	Springer Verlag
Pages	123-136
Number of pages	14
ISBN (Print)	9783540223795
DOIs	https://doi.org/10.1007/978-3-540-27800-9_11
Publication status	Published - 2004

Publication series

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

Keywords

Block Ciphers
SHACAL-1
The Rectangle Attack
The Related-Key Attack
The Related-Key Rectangle Attack

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-27800-9_11

Cite this

Kim, J., Kim, G., Hong, S., Lee, S., & Hong, D. (2004). The related-key rectangle attack - Application to SHACAL-1. In H. Wang, J. Pieprzyk, & V. Varadharajan (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 123-136). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3108). Springer Verlag. https://doi.org/10.1007/978-3-540-27800-9_11

The related-key rectangle attack - Application to SHACAL-1. / Kim, Jongsung; Kim, Guil; Hong, Seokhie et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Huaxiong Wang; Josef Pieprzyk; Vijay Varadharajan. Springer Verlag, 2004. p. 123-136 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3108).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Kim, J, Kim, G, Hong, S , Lee, S & Hong, D 2004, The related-key rectangle attack - Application to SHACAL-1. in H Wang, J Pieprzyk & V Varadharajan (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3108, Springer Verlag, pp. 123-136. https://doi.org/10.1007/978-3-540-27800-9_11

Kim J, Kim G, Hong S , Lee S, Hong D. The related-key rectangle attack - Application to SHACAL-1. In Wang H, Pieprzyk J, Varadharajan V, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 123-136. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-27800-9_11

Kim, Jongsung ; Kim, Guil ; Hong, Seokhie et al. / The related-key rectangle attack - Application to SHACAL-1. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Huaxiong Wang ; Josef Pieprzyk ; Vijay Varadharajan. Springer Verlag, 2004. pp. 123-136 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{b517977c05714b2b9f7f50a60c65aee3,

title = "The related-key rectangle attack - Application to SHACAL-1",

abstract = "The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of 2149.72 chosen plaintexts and a time complexity of 2498.30 encryptions, which is faster than exhaustive search.",

keywords = "Block Ciphers, SHACAL-1, The Rectangle Attack, The Related-Key Attack, The Related-Key Rectangle Attack",

author = "Jongsung Kim and Guil Kim and Seokhie Hong and Sangjin Lee and Dowon Hong",

year = "2004",

doi = "10.1007/978-3-540-27800-9_11",

language = "English",

isbn = "9783540223795",

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

publisher = "Springer Verlag",

pages = "123--136",

editor = "Huaxiong Wang and Josef Pieprzyk and Vijay Varadharajan",

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

}

TY - CHAP

T1 - The related-key rectangle attack - Application to SHACAL-1

AU - Kim, Jongsung

AU - Kim, Guil

AU - Hong, Seokhie

AU - Lee, Sangjin

AU - Hong, Dowon

PY - 2004

Y1 - 2004

N2 - The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of 2149.72 chosen plaintexts and a time complexity of 2498.30 encryptions, which is faster than exhaustive search.

AB - The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of 2149.72 chosen plaintexts and a time complexity of 2498.30 encryptions, which is faster than exhaustive search.

KW - Block Ciphers

KW - SHACAL-1

KW - The Rectangle Attack

KW - The Related-Key Attack

KW - The Related-Key Rectangle Attack

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

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

U2 - 10.1007/978-3-540-27800-9_11

DO - 10.1007/978-3-540-27800-9_11

M3 - Chapter

AN - SCOPUS:35048894987

SN - 9783540223795

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

SP - 123

EP - 136

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

A2 - Wang, Huaxiong

A2 - Pieprzyk, Josef

A2 - Varadharajan, Vijay

PB - Springer Verlag

ER -

The related-key rectangle attack - Application to SHACAL-1

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this