Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Some instant- and practical-time related-key attacks on KTANTAN32/48/64

Författare:
  • Martin Ågren
Publiceringsår: 2012
Språk: Engelska
Publikation/Tidskrift/Serie: LNCS
Dokumenttyp: Konferensbidrag
Förlag: Springer

Sammanfattning

The hardware-attractive block cipher family KTANTAN was studied by Bogdanov and Rechberger who identified flaws in the key schedule and gave a meet-in-the-middle attack. We revisit their result before investigating how to exploit the weakest key bits. We then develop several related-key attacks, e.g., one on KTANTAN32 which finds 28 key bits in time equivalent to $2^{3.0}$ calls to the full KTANTAN32 encryption. The main result is a related-key attack requiring $2^{28.44}$ time (half a minute on a current CPU) to recover the full 80-bit key. For KTANTAN48, we find three key bits in the time of one encryption, and give several other attacks, including full key recovery. For KTANTAN64, the attacks are only slightly more expensive, requiring $2^{10.71}$ time to find 38 key bits, and $2^{32.28}$ for the entire key. For all attacks, the requirements on related-key material are modest as in the forward and backward directions, we only need to flip a single key bit. All attacks succeed with probability one. Our attacks directly contradict the designers' claims. We discuss why this is, and what can be learnt from this.

Disputation

Nyckelord

  • Technology and Engineering
  • cryptanalysis
  • related key
  • block cipher
  • key schedule
  • lightweight cipher
  • key-recovery

Övriga

Selected Areas in Cryptography
2011-08-10 /2011-08-12
Toronto, Canada
Inpress
  • EIT_HSWC:Coding Coding, modulation, security and their implementation
Yes
  • Crypto and Security

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen