Cryptology ePrint Archive: Report 2016/141

On low degree polynomials in 2-round AES

Igor Semaev

Abstract: Recent observations on polynomial structures of AES-like round functions are analysed in this note. We present computational evidence that input/output bits of AES-like 2-round transform up to $40$-bit, constructed with $8$-bit AES S-boxes, do not satisfy any relations of degree $3$. So it is very unlikely that actual AES 2-round transform admits any relations of degree $\leq 3$.

Category / Keywords: secret-key cryptography / AES, low degree polynomials

Date: received 15 Feb 2016

Contact author: igor at ii uib no

Available format(s): PDF | BibTeX Citation

Version: 20160216:211116 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]