Bounds on the degree of APN polynomials: the case of \(x^{-1} + g(x)\)
From MaRDI portal
Publication:2430690
DOI10.1007/s10623-010-9456-yzbMath1218.94042MaRDI QIDQ2430690
Gregor Leander, François Rodier
Publication date: 8 April 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9456-y
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Partially APN Boolean functions and classes of functions that are not APN infinitely often, О приближении дискретных функций линейными функциями
Cites Work
- Unnamed Item
- Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions
- A few more quadratic APN functions
- New families of quadratic almost perfect nonlinear trinomials and multinomials
- Constructing new APN functions from known ones
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- La conjecture de Weil. I
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)
- Symmetric Cryptography and Algebraic Curves
- A new APN function which is not equivalent to a power mapping
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
- Number of Points of Varieties in Finite Fields