Improved Meet-in-the-Middle Cryptanalysis of KTANTAN

Lei Wei; Christian Rechberger; Jian Guo; Hongjun Wu; Huaxiong Wang; San Ling

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

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN

Lei Wei, Christian Rechberger, Jian Guo, Hongjun Wu, Huaxiong Wang, San Ling

Research output: Contribution to journal › Conference article › Research › peer-review

237 Downloads (Pure)

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 2(72.9), 2(73.8) and 2(74.4) respectively, each requiring 4 chosen-plaintexts.

Original language	English
Book series	Lecture Notes in Computer Science
Volume	6812
Pages (from-to)	433-438
ISSN	0302-9743
DOIs	https://doi.org/10.1007/978-3-642-22497-3_31
Publication status	Published - 2011
Externally published	Yes
Event	16th Australasian Conference on Information Security and Privacy - Melbourne, Australia Duration: 11 Jul 2011 → 13 Jul 2011 Conference number: 16

Conference

Conference	16th Australasian Conference on Information Security and Privacy
Number	16
Country/Territory	Australia
City	Melbourne
Period	11/07/2011 → 13/07/2011

Access to Document

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

B540Ad01Final published version, 190 KB

OpenUrl availability

Full text

Cite this

@inproceedings{1ec3bef6dfcb45a68a60c0d85707f127,

title = "Improved Meet-in-the-Middle Cryptanalysis of KTANTAN",

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 2(72.9), 2(73.8) and 2(74.4) respectively, each requiring 4 chosen-plaintexts.",

author = "Lei Wei and Christian Rechberger and Jian Guo and Hongjun Wu and Huaxiong Wang and San Ling",

year = "2011",

doi = "10.1007/978-3-642-22497-3_31",

language = "English",

volume = "6812",

pages = "433--438",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

note = "16th Australasian Conference on Information Security and Privacy, ACISP 2011 ; Conference date: 11-07-2011 Through 13-07-2011",

}

TY - GEN

T1 - Improved Meet-in-the-Middle Cryptanalysis of KTANTAN

AU - Wei, Lei

AU - Rechberger, Christian

AU - Guo, Jian

AU - Wu, Hongjun

AU - Wang, Huaxiong

AU - Ling, San

N1 - Conference code: 16

PY - 2011

Y1 - 2011

N2 - 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 2(72.9), 2(73.8) and 2(74.4) respectively, each requiring 4 chosen-plaintexts.

AB - 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 2(72.9), 2(73.8) and 2(74.4) respectively, each requiring 4 chosen-plaintexts.

U2 - 10.1007/978-3-642-22497-3_31

DO - 10.1007/978-3-642-22497-3_31

M3 - Conference article

SN - 0302-9743

VL - 6812

SP - 433

EP - 438

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 16th Australasian Conference on Information Security and Privacy

Y2 - 11 July 2011 through 13 July 2011

ER -

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this