You are looking at a specific version 20160216:211116 of this paper.
See the latest version.
Paper 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$.
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- AESlow degree polynomials
- Contact author(s)
- igor @ ii uib no
- History
- 2016-02-16: received
- Short URL
- https://ia.cr/2016/141
- License
-
CC BY