Improved Meet-in-the-Middle Cryptanalysis of KTANTAN

Publication: Research - peer-reviewConference article – Annual report year: 2011

Without internal affiliation

Standard

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN. / Wei, Lei; Rechberger, Christian; Guo, Jian; Wu, Hongjun; Wang, Huaxiong; Ling, San.

In: Lecture Notes in Computer Science, Vol. 6812, 2011, p. 433-438.

Publication: Research - peer-reviewConference article – Annual report year: 2011

Harvard

APA

CBE

MLA

Vancouver

Author

Wei, Lei; Rechberger, Christian; Guo, Jian; Wu, Hongjun; Wang, Huaxiong; Ling, San / Improved Meet-in-the-Middle Cryptanalysis of KTANTAN.

In: Lecture Notes in Computer Science, Vol. 6812, 2011, p. 433-438.

Publication: Research - peer-reviewConference article – Annual report year: 2011

Bibtex

@article{1ec3bef6dfcb45a68a60c0d85707f127,
title = "Improved Meet-in-the-Middle Cryptanalysis of KTANTAN",
publisher = "Springer",
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",
volume = "6812",
pages = "433--438",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",

}

RIS

TY - CONF

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

A1 - Wei,Lei

A1 - Rechberger,Christian

A1 - Guo,Jian

A1 - Wu,Hongjun

A1 - Wang,Huaxiong

A1 - Ling,San

AU - Wei,Lei

AU - Rechberger,Christian

AU - Guo,Jian

AU - Wu,Hongjun

AU - Wang,Huaxiong

AU - Ling,San

PB - Springer

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

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

VL - 6812

SP - 433

EP - 438

ER -