Three-subset meet-in-the-middle attack on reduced XTEA

Authors:
Yu Sasaki;Lei Wang;Yasuhide Sakai;Kazuo Sakiyama;Kazuo Ohta
Affiliations:
NTT Secure Platform Laboratories, NTT Corporation, Musashino-shi, Tokyo, Japan;The University of Electro-Communications, Choufu-shi, Tokyo, Japan;The University of Electro-Communications, Choufu-shi, Tokyo, Japan;The University of Electro-Communications, Choufu-shi, Tokyo, Japan;The University of Electro-Communications, Choufu-shi, Tokyo, Japan
Venue:
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Year:
2012

Citing 20
Cited 0

Cryptanalysis of DES with a reduced number of rounds

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Key-Schedule Cryptoanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA

FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Computer
A Meet-in-the-Middle Attack on 8-Round AES

Fast Software Encryption
Chai-Tea, Cryptographic Hardware Implementations of xTEA

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Preimage Attacks on 3, 4, and 5-Pass HAVAL

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Related-key rectangle attack on 36 rounds of the XTEA block cipher

International Journal of Information Security
Finding Preimages in Full MD5 Faster Than Exhaustive Search

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Preimage Attacks on One-Block MD4, 63-Step MD5 and More

Selected Areas in Cryptography
Preimages for Step-Reduced SHA-2

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Another look at complementation properties

FSE'10 Proceedings of the 17th international conference on Fast software encryption
A 3-subset meet-in-the-middle attack: cryptanalysis of the lightweight block cipher KTANTAN

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Meet-in-the-middle attacks on reduced-round XTEA

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
A single-key attack on the full GOST block cipher

FSE'11 Proceedings of the 18th international conference on Fast software encryption
Improved meet-in-the-middle cryptanalysis of KTANTAN

ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
A weak key class of XTEA for a related-key rectangle attack

VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Biclique cryptanalysis of the full AES

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an improved single-key attack on a block-cipher XTEA by using the three-subset meet-in-the-middle (MitM) attack. Firstly, a technique on a generic block-cipher is discussed. It points out that the previous work applying the splice-and-cut technique to the three-subset MitM attack contains incomplete arguments, and thus it requires a very large data complexity, which is close to the code book. This paper gives a corrected procedure to keep the data complexity small. Secondly, the three-subset MitM attack is applied for reduced-round XTEA, which is a 64-bit block-cipher with 64-round Feistel network and a 128-bit key. 25 rounds are attacked with 9 known plaintexts and 2120.40 XTEA computations, while the previous best single-key attack only reaches 23 rounds. In the chosen-plaintext model, the attack is extended to 28 rounds with 237 chosen-plaintexts and 2120.38 computations.