Impossible differential cryptanalysis of reduced round XTEA and TEA

Dukjae Moon; Kyungdeok Hwang; Wonil Lee; Sangjin Lee; Jongin Lim

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

Impossible differential cryptanalysis of reduced round XTEA and TEA

Dukjae Moon
, Kyungdeok Hwang
, Wonil Lee
, Sangjin Lee
, Jongin Lim

School of Cybersecurity

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

44 Citations (Scopus)

Abstract

We present the impossible differential cryptanalysis of the block cipher XTEA[7] and TEA[6]. The core of the design principle of these block ciphers is an easy implementation and a simplicity. But this simplicity dose not offer a large diffusion property. Our impossible differential cryptanalysis of reduced-round versions of XTEA and TEA is based on this fact. We will show how to construct a 12-round impossible characteristic of XTEA. We can then derive 128-bit user key of the 14-round XTEA with 2^62.5 chosen plaintexts and 2⁸⁵ encryption times using the 12-round impossible characteristic. In addition, we will show how to construct a 10-round impossible characteristic of TEA. Then we can derive 128-bit user key of the 11-round TEA with 2^52.5 chosen plaintexts and 2⁸⁴ encryption times using the 10-round impossible characteristic.

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	49-60
Number of pages	12
ISBN (Print)	9783540440093
DOIs	https://doi.org/10.1007/3-540-45661-9_4
Publication status	Published - 2002
Event	9th International Workshop on Fast Software Encryption, FSE 2002 - Leuven, Belgium Duration: 2002 Feb 4 → 2002 Feb 6

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

Other

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

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_4

Cite this

Moon, D., Hwang, K., Lee, W., Lee, S., & Lim, J. (2002). Impossible differential cryptanalysis of reduced round XTEA and TEA. In J. Daemen, & V. Rijmen (Eds.), Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers (pp. 49-60). (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_4

Impossible differential cryptanalysis of reduced round XTEA and TEA. / Moon, Dukjae; Hwang, Kyungdeok; Lee, Wonil et al.
Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. ed. / Joan Daemen; Vincent Rijmen. Springer Verlag, 2002. p. 49-60 (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

Moon, D, Hwang, K, Lee, W, Lee, S & Lim, J 2002, Impossible differential cryptanalysis of reduced round XTEA and TEA. 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. 49-60, 9th International Workshop on Fast Software Encryption, FSE 2002, Leuven, Belgium, 02/2/4. https://doi.org/10.1007/3-540-45661-9_4

Moon D, Hwang K, Lee W, Lee S , Lim J. Impossible differential cryptanalysis of reduced round XTEA and TEA. In Daemen J, Rijmen V, editors, Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. Springer Verlag. 2002. p. 49-60. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45661-9_4

Moon, Dukjae ; Hwang, Kyungdeok ; Lee, Wonil et al. / Impossible differential cryptanalysis of reduced round XTEA and TEA. Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers. editor / Joan Daemen ; Vincent Rijmen. Springer Verlag, 2002. pp. 49-60 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5e263497145548b28f3f78109440866f,

title = "Impossible differential cryptanalysis of reduced round XTEA and TEA",

abstract = "We present the impossible differential cryptanalysis of the block cipher XTEA[7] and TEA[6]. The core of the design principle of these block ciphers is an easy implementation and a simplicity. But this simplicity dose not offer a large diffusion property. Our impossible differential cryptanalysis of reduced-round versions of XTEA and TEA is based on this fact. We will show how to construct a 12-round impossible characteristic of XTEA. We can then derive 128-bit user key of the 14-round XTEA with 262.5 chosen plaintexts and 285 encryption times using the 12-round impossible characteristic. In addition, we will show how to construct a 10-round impossible characteristic of TEA. Then we can derive 128-bit user key of the 11-round TEA with 252.5 chosen plaintexts and 284 encryption times using the 10-round impossible characteristic.",

author = "Dukjae Moon and Kyungdeok Hwang and Wonil Lee and Sangjin Lee and Jongin Lim",

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\_4",

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 = "49--60",

editor = "Joan Daemen and Vincent Rijmen",

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

}

TY - GEN

T1 - Impossible differential cryptanalysis of reduced round XTEA and TEA

AU - Moon, Dukjae

AU - Hwang, Kyungdeok

AU - Lee, Wonil

AU - Lee, Sangjin

AU - Lim, Jongin

PY - 2002

Y1 - 2002

N2 - We present the impossible differential cryptanalysis of the block cipher XTEA[7] and TEA[6]. The core of the design principle of these block ciphers is an easy implementation and a simplicity. But this simplicity dose not offer a large diffusion property. Our impossible differential cryptanalysis of reduced-round versions of XTEA and TEA is based on this fact. We will show how to construct a 12-round impossible characteristic of XTEA. We can then derive 128-bit user key of the 14-round XTEA with 262.5 chosen plaintexts and 285 encryption times using the 12-round impossible characteristic. In addition, we will show how to construct a 10-round impossible characteristic of TEA. Then we can derive 128-bit user key of the 11-round TEA with 252.5 chosen plaintexts and 284 encryption times using the 10-round impossible characteristic.

AB - We present the impossible differential cryptanalysis of the block cipher XTEA[7] and TEA[6]. The core of the design principle of these block ciphers is an easy implementation and a simplicity. But this simplicity dose not offer a large diffusion property. Our impossible differential cryptanalysis of reduced-round versions of XTEA and TEA is based on this fact. We will show how to construct a 12-round impossible characteristic of XTEA. We can then derive 128-bit user key of the 14-round XTEA with 262.5 chosen plaintexts and 285 encryption times using the 12-round impossible characteristic. In addition, we will show how to construct a 10-round impossible characteristic of TEA. Then we can derive 128-bit user key of the 11-round TEA with 252.5 chosen plaintexts and 284 encryption times using the 10-round impossible characteristic.

UR - https://www.scopus.com/pages/publications/84949443075

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

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

M3 - Conference contribution

AN - SCOPUS:84949443075

SN - 9783540440093

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

SP - 49

EP - 60

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 -

Impossible differential cryptanalysis of reduced round XTEA and TEA

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this