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

Eunjin Lee, Deukjo Hong, Donghoon Chang, Seokhie Hong, Jong In Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages286-297
Number of pages12
Volume4341 LNCS
DOIs
Publication statusPublished - 2006 Dec 1
Event1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006 - Hanoi, Viet Nam
Duration: 2006 Sep 252006 Sep 28

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4341 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006
CountryViet Nam
CityHanoi
Period06/9/2506/9/28

Fingerprint

Rectangle
Cryptography
Attack
Block Cipher
Encryption
Class

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lee, E., Hong, D., Chang, D., Hong, S., & Lim, J. I. (2006). A weak key class of XTEA for a related-key rectangle attack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4341 LNCS, pp. 286-297). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4341 LNCS). 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; Hong, Seokhie; Lim, Jong In.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4341 LNCS 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 proceedingConference contribution

Lee, E, Hong, D, Chang, D, Hong, S & Lim, JI 2006, A weak key class of XTEA for a related-key rectangle attack. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4341 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4341 LNCS, 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 JI. A weak key class of XTEA for a related-key rectangle attack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4341 LNCS. 2006. p. 286-297. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11958239-19
Lee, Eunjin ; Hong, Deukjo ; Chang, Donghoon ; Hong, Seokhie ; Lim, Jong In. / A weak key class of XTEA for a related-key rectangle attack. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4341 LNCS 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 Lim, {Jong In}",
year = "2006",
month = "12",
day = "1",
doi = "10.1007/11958239-19",
language = "English",
isbn = "3540687998",
volume = "4341 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "286--297",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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, Jong In

PY - 2006/12/1

Y1 - 2006/12/1

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

UR - http://www.scopus.com/inward/citedby.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

VL - 4341 LNCS

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

SP - 286

EP - 297

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

ER -