Cryptology ePrint Archive: Report 2019/622

Extended Expectation Cryptanalysis on Round-reduced AES

Zhenzhen Bao and Jian Guo and Eik List

Abstract: Distinguishers on round-reduced AES have attracted considerable attention in the recent years. Although the number of rounds covered in key-recovery attacks has not been increased since, subspace, yoyo, and multiple-of-n cryptanalysis advanced the understanding of properties of the cipher. Expectation cryptanalysis is an umbrella term for all forms of statistical analysis that try to identify properties whose expectation differs from that of an ideal primitive. For substitution-permutation networks, integral attacks seem a suitable target for extension since they usually end after a linear layer sums several subcomponents. Based on results by Patarin, Chen et al. already observed that the expected number of collisions differs slightly for a sum of permutations from the ideal. Though, their target remained lightweight primitives. The present work applies expectation-based distinguisher from a sum of PRPs to round-reduced AES. We show how to extend the well-known 3-round integral distinguisher to expectation distinguishers over 4 and 5 rounds. In contrast to previous expectation distinguishers by Grassi et al., our approach allows to prepend a round that starts from a diagonal subspace. We demonstrate how the prepended round can be used for key recovery. Moreover, we show how the prepended round can be integrated to form a six-round distinguisher. For all distinguishers, our results are supported by their implementations with Cid et al.'s established Small-AES version.

Category / Keywords: secret-key cryptography / cryptanalysis, block cipher, AES

Date: received 1 Jun 2019

Contact author: eik list at uni-weimar de,zzbao@ntu edu sg,guojian@ntu edu sg

Available format(s): PDF | BibTeX Citation

Version: 20190603:070958 (All versions of this report)

Short URL: ia.cr/2019/622


[ Cryptology ePrint archive ]