On relations between CCZ- and EA-equivalences
From MaRDI portal
Publication:2179506
DOI10.1007/s12095-019-00367-5zbMath1446.94110OpenAlexW2893055214WikidataQ127880531 ScholiaQ127880531MaRDI QIDQ2179506
Marco Calderini, Lilya Budaghyan, Irene Villa
Publication date: 12 May 2020
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1956/22273
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (94D10)
Related Items (5)
Two classes of permutation trinomials over \(\mathbb{F}_{q^3}\) in characteristic two ⋮ Generalized isotopic shift construction for APN functions ⋮ On subspaces of Kloosterman zeros and permutations of the form \(L_1(x^{-1})+L_2(x)\) ⋮ On the EA-classes of known APN functions in small dimensions ⋮ On known constructions of APN and AB functions and their relation to each other
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalences of power APN functions with power or quadratic APN functions
- A note on linearized polynomials and the dimension of their kernels
- Differential cryptanalysis of DES-like cryptosystems
- On the classification of APN functions up to dimension five
- Constructing new APN functions from known ones
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- On CCZ-equivalence, extended-affine equivalence, and function twisting
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- A new almost perfect nonlinear function which is not quadratic
- A note on APN permutations in even dimension
- CCZ equivalence of power functions
- New classes of almost bent and almost perfect nonlinear polynomials
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- On Almost Perfect Nonlinear Permutations
- On the Classification of 4 Bit S-Boxes
- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
This page was built for publication: On relations between CCZ- and EA-equivalences
