APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)

DOI10.1016/j.ffa.2007.04.004zbMath1133.11068OpenAlexW1600014270MaRDI QIDQ2467333

David Jedlicka

Publication date: 21 January 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2007.04.004

zbMATH Keywords

monomialirreducibleAES S-box

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Communication, information (94A99) Polynomials over finite fields (11T06)

Related Items (17)

Exceptional scattered polynomials ⋮ On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb {P}^{3}\) in characteristic 2. II ⋮ A infinite class of Kasami functions that are not APN infinitely often ⋮ On the exceptionality of rational APN functions ⋮ Some new techniques and progress towards the resolution of the conjecture of exceptional APN functions and absolutely irreducibility of a class of polynomials ⋮ On a generalization of planar functions ⋮ Bounds on the degree of APN polynomials: the case of \(x^{-1} + g(x)\) ⋮ Almost perfect and planar functions ⋮ On the classification of exceptional scattered polynomials ⋮ Planar functions over fields of characteristic two ⋮ Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions ⋮ Functions of degree \(4e\) that are not APN infinitely often ⋮ On the conjecture on APN functions and absolute irreducibility of polynomials ⋮ On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb{P}^3\) in characteristic \(2\) ⋮ О приближении дискретных функций линейными функциями ⋮ The State of the Art on the Conjecture of Exceptional APN Functions ⋮ Functions which are PN on infinitely many extensions of \(\mathbb F_p\), \(p\) odd

Cites Work

• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
• Multiplicative difference sets via additive characters
• On the Preparata and Goethals codes
• On the minimum distance of cyclic codes
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)