Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster)

  • Lei Wei
  • Christian Rechberger
  • Jian Guo
  • Hongjun Wu
  • Huaxiong Wang
  • San Ling
Conference paper

DOI: 10.1007/978-3-642-22497-3_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6812)
Cite this paper as:
Wei L., Rechberger C., Guo J., Wu H., Wang H., Ling S. (2011) Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster). In: Parampalli U., Hawkes P. (eds) Information Security and Privacy. ACISP 2011. Lecture Notes in Computer Science, vol 6812. Springer, Berlin, Heidelberg

Abstract

This paper presents ongoing work towards extensions of meet-in-the-middle (MITM) attacks on block ciphers. Exploring developments in MITM attacks in hash analysis such as: (i) the splice-and-cut technique; (ii) the indirect-partial-matching technique. Our first contribution is that we show corrections to previous cryptanalysis and point out that the key schedule is more vulnerable to MITM attacks than previously reported. Secondly we further improve the time complexities of previous attacks with (i) and (ii), now the 80-bit secret key of the full rounds KTANTAN-{32,48,64} can be recovered at time complexity of 272.9, 273.8 and 274.4 respectively, each requiring 4 chosen-plaintexts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Lei Wei
    • 1
  • Christian Rechberger
    • 2
  • Jian Guo
    • 3
  • Hongjun Wu
    • 1
  • Huaxiong Wang
    • 1
  • San Ling
    • 1
  1. 1.Nanyang Technological UniversitySingapore
  2. 2.ESAT/COSIC and IBBTKatholieke Universiteit LeuvenBelgium
  3. 3.Institute for Infocomm Research, A*STARSingapore

Personalised recommendations