On the conjecture on APN functions and absolute irreducibility of polynomials
DOI10.1007/s10623-015-0168-1zbMath1370.94503OpenAlexW2261578765WikidataQ123095156 ScholiaQ123095156MaRDI QIDQ510416
Heeralal Janwa, Moises Delgado
Publication date: 17 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0168-1
cyclic codesabsolutely irreducible polynomialCCZ-equivalenceEA-equivalenceDeligne estimatealmost perfect nonlinear (APN)Gold functionKasami functionLang-Weil estimate
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new large class of functions not APN infinitely often
- 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
- Constructing new APN functions from known ones
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: the Gold case
- APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)
- A few more functions that are not APN infinitely often
- A new APN function which is not equivalent to a power mapping
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- Some more functions that are not APN infinitely often. The case of Gold and Kasami exponents
This page was built for publication: On the conjecture on APN functions and absolute irreducibility of polynomials