APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) (Q2467333)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: APN monomials over GF(2ⁿ) for infinitely many n |
scientific article; zbMATH DE number 5228795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) |
scientific article; zbMATH DE number 5228795 |
Statements
APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) (English)
0 references
21 January 2008
0 references
It is known that an application of Weil's theorem on absolutely irreducible curves shows that a monomial \(x^m\) is not Almost Perfect Nonlinear (APN) over \(\mathbb{F}_{2^n}\) for all sufficiently large \(n\) if a related two variable polynomial has an absolutely irreducible factor defined over \(\mathbb{F}_2\). Using the latter fact it is shown in this paper that except in three specific, narrowly defined cases, all monomials have such a factor over a finite field of characteristic 2. Two of these cases, those with exponents of the form \(2^k+1\) or \(4^k-2^k+1\) for any integer \(k\), are already known to be APN for infinitely many fields. The last case when a certain gcd is maximal remains still unproven.
0 references
monomial
0 references
AES S-box
0 references
irreducible
0 references
0 references
0 references
0.8560464382171631
0 references
0.8158886432647705
0 references
0.8155485987663269
0 references