Zero-Correlation Linear Cryptanalysis of Reduced Round ARIA with Partial-sum and FFT

• Wen-Tan Yi,
• Shao-Zhen Chen,
• Kuan-Yang Wei,

Vol. 9, No. 1, January 30, 2015
10.3837/tiis.2015.01.015, Download Paper (Free):

• ARIA
• Zero-correlation linear cryptanalysis
• Partial-sum
• FFT
• Cryptography.

Abstract

Block cipher ARIA was first proposed by some South Korean experts in 2003, and later, it was established as a Korean Standard block cipher algorithm by Korean Agency for Technology and Standards. In this paper, we focus on the security evaluation of ARIA block cipher against the recent zero-correlation linear cryptanalysis. In addition, Partial-sum technique and FFT (Fast Fourier Transform) technique are used to speed up the cryptanalysis, respectively. We first introduce some 4-round linear approximations of ARIA with zero-correlation, and then present some key-recovery attacks on 6/7-round ARIA-128/256 with the Partial-sum technique and FFT technique. The key-recovery attack with Partial-sum technique on 6-round ARIA-128 needs 123.6 2 known plaintexts (KPs), 121 2 encryptions and 90.3 2 bytes memory, and the attack with FFT technique requires 124.1 2 KPs, 121.5 2 encryptions and 90.3 2 bytes memory. Moreover, applying Partial-sum technique, we can attack 7-round ARIA-256 with 124.6 2 KPs, 203.52 encryptions and 152 2 bytes memory and 7-round ARIA-256 employing FFT technique, requires 124.7 2 KPs, 209.5 2 encryptions and 152 2 bytes memory . Our results are the first zero- correlation linear cryptanalysis results on ARIA.

Statistics

Cite this article