Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
From MaRDI portal
Publication:662182
DOI10.1007/s12095-011-0045-3zbMath1251.94032OpenAlexW1976760079MaRDI QIDQ662182
Publication date: 21 February 2012
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-011-0045-3
Related Items (12)
Bent and permutational properties of Budaghyan-Carlet hexanomials ⋮ Sparse permutations with low differential uniformity ⋮ Two classes of permutation trinomials over \(\mathbb{F}_{q^3}\) in characteristic two ⋮ Boomerang uniformity of popular S-box constructions ⋮ On subspaces of Kloosterman zeros and permutations of the form \(L_1(x^{-1})+L_2(x)\) ⋮ 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})\) ⋮ 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)\) ⋮ Results on rotation-symmetric S-boxes ⋮ Constructing Generalized Bent Functions from Trace Forms of Galois Rings ⋮ On the EA-classes of known APN functions in small dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
- On EA-equivalence of certain permutations to power mappings
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- 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$
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- On Almost Perfect Nonlinear Permutations
This page was built for publication: Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
