Cryptology ePrint Archive: Report 2013/573
Improved Meet-in-the-Middle Attacks on AES-192 and PRINCE
Leibo Li and Keting Jia and Xiaoyun Wang
Abstract: This paper studies key-recovery attacks on AES-192 and PRINCE under single-key model by methodology of meet-in-the-middle attack. A new technique named key-dependent sieve is proposed to further reduce the memory complexity of Demirci et al.'s attack at EUROCRYPT
2013, which helps us to achieve 9-round attack on AES-192 by using a 5-round distinguisher; the data, time and memory complexities are 2^{121} chosen plaintexts, 2^{185} encryptions and 2^{185} 128-
bit memories, respectively. The new technique is also applied to attack block cipher PRINCE. Instead of 6-round results in the previous cryptanalysis, we rst present attacks on 8-round (out
of 12) PRINCEcore and PRINCE with about 2^{53} and 2^{60} encryptions, respectively. Furthermore, we construct an interesting 7-round distinguisher and extend the attack to 9-round PRINCE; the
attack needs about 2^{57} chosen plaintexts, 2^{64} encryptions and 2^{57.3} 64-bit memories.
Category / Keywords: secret-key cryptography /
Date: received 6 Sep 2013
Contact author: lileibo at mail sdu edu cn
Available format(s): PDF | BibTeX Citation
Version: 20130910:155807 (All versions of this report)
Short URL: ia.cr/2013/573
[ Cryptology ePrint archive ]