The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
From MaRDI portal
Recommendations
- Constructing new APN functions from known ones
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
- On the equivalence between a new family of APN quadrinomials and the power APN functions
- Constructing new APN functions from known PN functions
- On the EA-classes of known APN functions in small dimensions
Cited in
(13)- Constructing new APN functions from known ones
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- Classification of quadratic APN functions with coefficients in \(\mathbb{F}_2\) for dimensions up to 9
- A further study of quadratic APN permutations in dimension nine
- On relations between CCZ- and EA-equivalences
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
- On EA-equivalence of certain permutations to power mappings
- On equivalence between known polynomial APN functions and power APN functions
- Relative difference sets, graphs and inequivalence of functions between groups
- On the approximation of discrete functions by linear functions
- EA and CCZ Equivalence of Functions over GF(2 n )
- On Cryptographically Significant Mappings over GF(2 n )
- Parametric construction approach of balanced Boolean functions from two-to-one mappings
This page was built for publication: The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426089)
