A weak key class of XTEA for a related-key rectangle attack

Eunjin Lee; Deukjo Hong; Donghoon Chang; Seokhie Hong; Jongin Lim

doi:10.1007/11958239_19

A weak key class of XTEA for a related-key rectangle attack

Eunjin Lee, Deukjo Hong, Donghoon Chang, Seokhie Hong, Jongin Lim

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

10 Citations (Scopus)

Abstract

XTEA is a block cipher with a very simple structure but there has not been found attack even for half of full round version i.e 32-round version. In this paper we introduce a class of weak keys which makes a 34-round reduced version of XTEA vulnerable to the related-key rectangle attack. The number of such weak keys is about 2. Our attack on a 34-round reduced version of XTEA under weak key assumption requires 2 chosen plaintexts and 2. 34-round XTEA encryptions.

Original language	English
Title of host publication	Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers
Publisher	Springer Verlag
Pages	286-297
Number of pages	12
ISBN (Print)	3540687998, 9783540687993
DOIs	https://doi.org/10.1007/11958239_19
Publication status	Published - 2006
Event	1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006 - Hanoi, Viet Nam Duration: 2006 Sept 25 → 2006 Sept 28

Publication series

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

Other

Other	1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006
Country/Territory	Viet Nam
City	Hanoi
Period	06/9/25 → 06/9/28

Keywords

Related-key rectangle attack
Weak key class of XTEA
XTEA algorithm

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11958239_19

Cite this

Lee, E., Hong, D., Chang, D., Hong, S., & Lim, J. (2006). A weak key class of XTEA for a related-key rectangle attack. In Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers (pp. 286-297). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4341 LNCS). Springer Verlag. https://doi.org/10.1007/11958239_19

A weak key class of XTEA for a related-key rectangle attack. / Lee, Eunjin; Hong, Deukjo; Chang, Donghoon et al.
Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers. Springer Verlag, 2006. p. 286-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4341 LNCS).

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

Lee, E, Hong, D, Chang, D, Hong, S & Lim, J 2006, A weak key class of XTEA for a related-key rectangle attack. in Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4341 LNCS, Springer Verlag, pp. 286-297, 1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006, Hanoi, Viet Nam, 06/9/25. https://doi.org/10.1007/11958239_19

Lee E, Hong D, Chang D, Hong S , Lim J. A weak key class of XTEA for a related-key rectangle attack. In Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers. Springer Verlag. 2006. p. 286-297. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11958239_19

Lee, Eunjin ; Hong, Deukjo ; Chang, Donghoon et al. / A weak key class of XTEA for a related-key rectangle attack. Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers. Springer Verlag, 2006. pp. 286-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9fcd0d4daa204f1ba7c1fb3787e2abc4,

title = "A weak key class of XTEA for a related-key rectangle attack",

abstract = "XTEA is a block cipher with a very simple structure but there has not been found attack even for half of full round version i.e 32-round version. In this paper we introduce a class of weak keys which makes a 34-round reduced version of XTEA vulnerable to the related-key rectangle attack. The number of such weak keys is about 2. Our attack on a 34-round reduced version of XTEA under weak key assumption requires 2 chosen plaintexts and 2. 34-round XTEA encryptions.",

keywords = "Related-key rectangle attack, Weak key class of XTEA, XTEA algorithm",

author = "Eunjin Lee and Deukjo Hong and Donghoon Chang and Seokhie Hong and Jongin Lim",

year = "2006",

doi = "10.1007/11958239_19",

language = "English",

isbn = "3540687998",

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

publisher = "Springer Verlag",

pages = "286--297",

booktitle = "Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers",

}

TY - GEN

T1 - A weak key class of XTEA for a related-key rectangle attack

AU - Lee, Eunjin

AU - Hong, Deukjo

AU - Chang, Donghoon

AU - Hong, Seokhie

AU - Lim, Jongin

PY - 2006

Y1 - 2006

N2 - XTEA is a block cipher with a very simple structure but there has not been found attack even for half of full round version i.e 32-round version. In this paper we introduce a class of weak keys which makes a 34-round reduced version of XTEA vulnerable to the related-key rectangle attack. The number of such weak keys is about 2. Our attack on a 34-round reduced version of XTEA under weak key assumption requires 2 chosen plaintexts and 2. 34-round XTEA encryptions.

AB - XTEA is a block cipher with a very simple structure but there has not been found attack even for half of full round version i.e 32-round version. In this paper we introduce a class of weak keys which makes a 34-round reduced version of XTEA vulnerable to the related-key rectangle attack. The number of such weak keys is about 2. Our attack on a 34-round reduced version of XTEA under weak key assumption requires 2 chosen plaintexts and 2. 34-round XTEA encryptions.

KW - Related-key rectangle attack

KW - Weak key class of XTEA

KW - XTEA algorithm

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

U2 - 10.1007/11958239_19

DO - 10.1007/11958239_19

M3 - Conference contribution

AN - SCOPUS:84887264477

SN - 3540687998

SN - 9783540687993

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

SP - 286

EP - 297

BT - Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers

PB - Springer Verlag

T2 - 1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006

Y2 - 25 September 2006 through 28 September 2006

ER -

A weak key class of XTEA for a related-key rectangle attack

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this