Guess-then-Meet-in-the-Middle Attacks on the KTANTAN Family of Block Ciphers

The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on KTANTAN. We show KTANTAN32/48/64 can be broken by using this new method in time complexities of 268.06 , 270.92 and 273.09 in terms of full-round KTANTANn encryptions respectively, which are better than the previous analysis results with complexities of 272.93 , 273.43 and 274.38 .

• Type: Journal
• Year: 2011
• Where: IACR
• Authors: Bo Zhu, Guang Gong
• Keywords: Block Cipher, Cryptanalysis, IACR 2011, Time Complexities