EA and CCZ Equivalence of Functions over GF(2 n )
From MaRDI portal
Publication:3519558
DOI10.1007/978-3-540-69499-1_12zbMath1247.94026OpenAlexW2121360689MaRDI QIDQ3519558
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_12
Related Items (3)
Hadamard matrices and their applications: progress 2007--2010 ⋮ CCZ equivalence of power functions ⋮ Relative difference sets, graphs and inequivalence of functions between groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bundles, presemifields and nonlinear functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Nonlinear functions in abelian groups and relative difference sets.
- Highly nonlinear mappings
- New classes of almost bent and almost perfect nonlinear polynomials
- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: EA and CCZ Equivalence of Functions over GF(2 n )