Publication: Research - peer-review › Conference article – Annual report year: 2011
In this paper we describe a variant of existing meet-in-the-middle attacks on block ciphers. As an application, we propose meet-in-the-middle attacks that are applicable to the KTANTAN family of block ciphers accepting a key of 80 bits. The attacks are due to sonic weaknesses in its bitwise key schedule(1). We report an attack of time complexity 2(75.170) encryptions on the full KTANTAN32 cipher with only 3 plaintext/ciphertext pairs and well as 2(75.044) encryptions on the full KTANTAN48 and 2(75.584) encryptions on the full KTANTAN69 with 2 plaintext/ciphertext pairs. All these attacks work in the classical attack model without any related keys. In the differential related-key model, we demonstrate 218- and 174- round differentials holding with probability I. This shows that a strong related-key property can translate to a successful attack in the non-related-key setting. Having extremely low data requirements, these attacks are valid even in RFID-like environments where only a very limited amount of text material may be available to an attacker.
|Journal||Lecture Notes in Computer Science|
|Conference||Selected Areas in Cryptography|
|Period||12/08/10 → 13/08/10|
|Citations||Web of Science® Times Cited: No match on DOI|
Loading map data...
No data available