The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
From MaRDI portal
Publication:5426089
DOI10.1007/978-3-540-73074-3_14zbMath1177.94133OpenAlexW1522641170MaRDI QIDQ5426089
Publication date: 15 November 2007
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73074-3_14
NonlinearityS-boxCCZ-equivalenceAlmost bentAlmost perfect nonlinearDifferential uniformityVectorial Boolean functionAffine equivalence
Related Items (11)
A further study of quadratic APN permutations in dimension nine ⋮ On relations between CCZ- and EA-equivalences ⋮ On EA-equivalence of certain permutations to power mappings ⋮ EA and CCZ Equivalence of Functions over GF(2 n ) ⋮ On Cryptographically Significant Mappings over GF(2 n ) ⋮ Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\) ⋮ Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\) ⋮ Classification of quadratic APN functions with coefficients in \(\mathbb{F}_2\) for dimensions up to 9 ⋮ Relative difference sets, graphs and inequivalence of functions between groups ⋮ Constructing new APN functions from known ones ⋮ О приближении дискретных функций линейными функциями
This page was built for publication: The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
