A Meet-in-the-Middle Attack on ARIA

Xuehai Tang; Bing Sun; Ruilin Li; Chao Li

Paper 2010/168

A Meet-in-the-Middle Attack on ARIA

Xuehai Tang, Bing Sun, Ruilin Li, and Chao Li

Abstract

In this paper, we study the meet-in-the-middle attack against block cipher ARIA. We find some new 3-round and 4-round distinguish- ing properties of ARIA. Based on the 3-round distinguishing property, we can apply the meet-in-the-middle attack with up to 6 rounds for all versions of ARIA. Based on the 4-round distinguishing property, we can mount a successful attack on 8-round ARIA-256. Furthermore, the 4-round distinguishing property could be improved which leads to a 7-round attack on ARIA-192. The data and time complexities of 7-round attack are 2^120 and 2^185:3, respectively. The data and time complexities of 8-round attack are 2^56 and 2^251:6, respectively. Compared with the existing cryptanalytic results on ARIA, our 5-round attack has the lowest data and time complexities and the 6-round attack has the lowest data complexity. Moreover, it is shown that 8-round ARIA-256 is not immune to the meet-in-the-middle attack.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: block cipher ARIA meet-in-the-middle time-memory trade-off
Contact author(s): txh0203 @ 163 com
History: 2010-03-30: received
Short URL: https://ia.cr/2010/168
License: CC BY

BibTeX

@misc{cryptoeprint:2010/168,
      author = {Xuehai Tang and Bing Sun and Ruilin Li and Chao Li},
      title = {A Meet-in-the-Middle Attack on ARIA},
      howpublished = {Cryptology ePrint Archive, Paper 2010/168},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/168}},
      url = {https://eprint.iacr.org/2010/168}
}