A lower bound on the number of inequivalent APN functions
From MaRDI portal
Publication:2062756
DOI10.1016/j.jcta.2021.105554zbMath1500.94086arXiv2002.00673OpenAlexW3205855107WikidataQ114162663 ScholiaQ114162663MaRDI QIDQ2062756
Publication date: 3 January 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.00673
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Boolean functions (06E30) Boolean functions (94D10)
Related Items (3)
On equivalence between two known families of APN polynomial functions and APN power functions ⋮ Image sets of perfectly nonlinear maps ⋮ On known constructions of APN and AB functions and their relation to each other
Uses Software
Cites Work
- Unnamed Item
- Equivalences of power APN functions with power or quadratic APN functions
- Almost perfect and planar functions
- On the classification of APN functions up to dimension five
- The Magma algebra system. I: The user language
- Equivalences of quadratic APN functions
- On CCZ-equivalence, extended-affine equivalence, and function twisting
- A new family of semifields with 2 parameters
- Determining the Walsh spectra of Taniguchi's and related APN-functions
- On equivalence between known families of quadratic APN functions
- Dimensional dual hyperovals and APN functions with translation groups
- On some quadratic APN functions
- Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions
- The number of almost perfect nonlinear functions grows exponentially
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- The permutation group of affine-invariant extended cyclic codes
- On known constructions of APN and AB functions and their relation to each other
- Construction and Analysis of Cryptographic Functions
This page was built for publication: A lower bound on the number of inequivalent APN functions
