International Workshop on Fast Software Encryption

FSE 2002: Fast Software Encryption pp 49-60

Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA

  • Dukjae Moon
  • Kyungdeok Hwang
  • Wonil Lee
  • Sangjin Lee
  • Jongin Lim
Conference paper

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

Volume 2365 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Moon D., Hwang K., Lee W., Lee S., Lim J. (2002) Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA. In: Daemen J., Rijmen V. (eds) Fast Software Encryption. FSE 2002. Lecture Notes in Computer Science, vol 2365. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Dukjae Moon
    • 1
  • Kyungdeok Hwang
    • 1
  • Wonil Lee
    • 1
  • Sangjin Lee
    • 1
  • Jongin Lim
    • 1
  1. 1.Center for Information and Security Technologies(CIST)Korea UniversitySeoulKorea