Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA

  • Dukjae Moon
  • Kyungdeok Hwang
  • Wonil Lee
  • Sangjin Lee
  • Jongin Lim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2365)

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.

References

  1. 1.
    E. Biham and A. Shamir, Differential Cryptanalysis of DES-like cryptosystems, Advances in Cryptology — CRYPTO’90, LNCS 537, Springer-Verlag, 1991, pp. 2–21.Google Scholar
  2. 2.
    E. Biham, New Types of Cryptanalytic Attacks Using Related Keys, Advances in Cryptology — EUROCRYT’93, Springer-Verlag, 1994, pp. 398–409.Google Scholar
  3. 3.
    E. Biham, A. Biryukov and A. Shamir, Cryptanalysis of skipjack reduced to 31 round using impossible differentiala, Advances in Cryptology-EUROCRYT’99, LNCS 1592, Springer-Verlag, 1999, pp. 12–23. Available at http://www.cs.technion.ac.il/ biham/Reports/Skipjack/.Google Scholar
  4. 4.
    L. R. Knudsen, Truncated and Higher Order Differential, Fast Software Encrytion Workshop 94, LNCS 1008, Springer-Verlag, 1995, pp. 229–236.Google Scholar
  5. 5.
    S. Moriai, T. Shimoyama and T. Kaneko, Higher Order Differential Attack of a CAST cipher,Fast Software Encrytion Workshop 98, LNCS 1372, Springer-Verlag, 1998, pp. 17–31.Google Scholar
  6. 6.
    D. Wheeler and R. Needham, TEA, a Tiny Encryption Algorithm, Fast Software Encryption, Second International Workshop Proceedings, Springer-Verlag, 1995, pp. 97–110.Google Scholar
  7. 7.
    D. Wheeler and R. Needham, TEA Extensions, October 1997.Google Scholar
  8. 8.
    J. Kelsey, B. Schneier and D. Wagner, Related-Key Cryptanalysis of 3-WAY, BihamDES, CAST, DES-X, NewDES, RC2, and TEA, In Information and Communications Security-Proceedings of ICICS 1997, Lecture Notes in Computer Science 1334, Springer-Verlag, 1997.Google Scholar

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

Personalised recommendations