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

DOI10.1016/j.ffa.2007.04.004zbMath1133.11068MaRDI 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

monomial; irreducible; AES S-box

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A99: Communication, information

11T06: Polynomials over finite fields

Related Items

The State of the Art on the Conjecture of Exceptional APN Functions, 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, Planar functions over fields of characteristic two, On the conjecture on APN functions and absolute irreducibility of polynomials, 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, Almost perfect and planar functions, Exceptional scattered polynomials, On a generalization of planar functions, On the classification of exceptional scattered polynomials, Functions which are PN on infinitely many extensions of \(\mathbb F_p\), \(p\) odd, On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb {P}^{3}\) in characteristic 2. II, Bounds on the degree of APN polynomials: the case of \(x^{-1} + g(x)\), On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb{P}^3\) in characteristic \(2\), О приближении дискретных функций линейными функциями

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.)