On EA-equivalence of certain permutations to power mappings
From MaRDI portal
Publication:2430411
DOI10.1007/s10623-010-9406-8zbMath1216.94049OpenAlexW2103480758MaRDI QIDQ2430411
Publication date: 6 April 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9406-8
Related Items (18)
The \textit{crooked} property ⋮ Bent and permutational properties of Budaghyan-Carlet hexanomials ⋮ Results on Constructions of Rotation Symmetric Bent and Semi-bent Functions ⋮ Sparse permutations with low differential uniformity ⋮ A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions ⋮ On permutation polynomials of the formx1+2k+ L(x) ⋮ Two classes of permutation trinomials over \(\mathbb{F}_{q^3}\) in characteristic two ⋮ Boomerang uniformity of popular S-box constructions ⋮ Four decades of research on bent functions ⋮ Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\) ⋮ On subspaces of Kloosterman zeros and permutations of the form \(L_1(x^{-1})+L_2(x)\) ⋮ Some permutation polynomials over finite fields ⋮ Permutation polynomials of the form \(x^d+L(x^{s})\) over \(\mathbb{F}_{q^3}\) ⋮ Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\) ⋮ Two classes of permutation trinomials with Niho exponents over finite fields with even characteristic ⋮ Involutory differentially 4-uniform permutations from known constructions ⋮ On theorems of Carlitz and Payne on permutation polynomials over finite fields with an application to \(x^{-1}+L(x)\) ⋮ New classes of permutation trinomials over \(\mathbb{F}_{q^3}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Bundles, presemifields and nonlinear functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- On Cryptographically Significant Mappings over GF(2 n )
- New classes of almost bent and almost perfect nonlinear polynomials
- A new APN function which is not equivalent to a power mapping
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2
- Complete Mapping Polynomials over Finite Field F 16
- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
- On the Generalized Linear Equivalence of Functions Over Finite Fields
This page was built for publication: On EA-equivalence of certain permutations to power mappings
