APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) (Q2467333): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ffa.2007.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1600014270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Preparata and Goethals codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes, bent functions and permutations suitable for DES-like cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative difference sets via additive characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5571530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum distance of cyclic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5794285 / rank
 
Normal rank

Latest revision as of 15:36, 27 June 2024

scientific article
Language Label Description Also known as
English
APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)
scientific article

    Statements

    APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) (English)
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    monomial
    0 references
    AES S-box
    0 references
    irreducible
    0 references
    0 references