Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
From MaRDI portal
Publication:2248639
DOI10.1007/s10623-012-9760-9zbMath1319.94077OpenAlexW2102294760MaRDI QIDQ2248639
Publication date: 27 June 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9760-9
Related Items (28)
Non-monomial permutations with differential uniformity six ⋮ New explicit constructions of differentially 4-uniform permutations via special partitions of \(\mathbb{F}_{2^{2 k}}\) ⋮ A new family of differentially 4-uniform permutations over \(\mathbb{F}_{2^{2k}}\) for odd \(k\) ⋮ Implicit Quadratic Property of Differentially 4-Uniform Permutations ⋮ A method to calculate differential uniformity for permutations ⋮ On the construction of differentially 4-uniform involutions ⋮ New differentially 4-uniform permutations from modifications of the inverse function ⋮ Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\) ⋮ Some Binomial and Trinomial Differentially 4-Uniform Permutation Polynomials ⋮ Ambiguity and deficiency for differentially 4-uniform monomial permutations on \(\mathbb{F}_{2^n}\) ⋮ Constructing New Piecewise Differentially 4-Uniform Permutations from Known APN Functions ⋮ D-property for APN functions from \(\mathbb{F}_2^n\) to \(\mathbb{F}_2^{n+1}\) ⋮ More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd ⋮ A class of power mappings with low boomerang uniformity ⋮ On CCZ-equivalence between the Bracken-Tan-Tan function and power functions ⋮ More constructions of APN and differentially 4-uniform functions by concatenation ⋮ Differentially low uniform permutations from known 4-uniform functions ⋮ Low differentially uniform permutations from the Dobbertin APN function over \(\mathbb{F}_{2^n} \) ⋮ Differentially 4-uniform bijections by permuting the inverse function ⋮ New differentially 4-uniform permutations by modifying the inverse function on subfields ⋮ Involutory differentially 4-uniform permutations from known constructions ⋮ More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\) ⋮ Constructing new differentially 4-uniform permutations from known ones ⋮ New secondary constructions of differentially 4-uniform permutations over ⋮ Results on symmetric S-boxes constructed by concatenation of RSSBs ⋮ A method of construction of differentially 4-uniform permutations over \(V_m\) for even \(m\) ⋮ Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem ⋮ Constructing differentially 4-uniform involutions over \(\mathbb{F}_{2^{2k}}\) by using Carlitz form
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binomial differentially 4 uniform permutations with high nonlinearity
- A few more quadratic APN functions
- Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
- Differential cryptanalysis of DES-like cryptosystems
- New families of quadratic almost perfect nonlinear trinomials and multinomials
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Constructing new APN functions from known ones
- One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- On EA-equivalence of certain permutations to power mappings
- On Known and New Differentially Uniform Functions
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- New classes of almost bent and almost perfect nonlinear polynomials
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
- On Almost Perfect Nonlinear Permutations
- 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: Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
