New differentially 4-uniform permutations from modifications of the inverse function
This paper proposes new types of permutations suitable for private key cryptosystems based on S-box such as DES or AES, permutations resistant to linear and differential cryptanalysis. The proposed permutations are differentially 4-uniform, a type of permutations studied by many authors. \textit{Y. Li} et al. [``Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2k})\) from the inverse function revisited, Preprint, \url{https://eprint.iacr.org/2013/731}] construct differentially 4-uniform permutations over the finite field \(\mathbf{F}_{2^n}\)\, modifying the inverse function in this field by a cycle. The present paper provides differentially 4-uniform permutations modifying the inverse function by two cycles (in fact two transpositions). Section 2 summarizes the necessary background on differential uniformity and nonlinearity. Section 3 generalizes the study of Li, Wang and Yu [loc. cit.], giving sufficient conditions for a permutation, obtained modifying the inverse function by several cycles, to be differentially 4-uniform (Theorem 3.6) and Section 4 particularizes these results to the case of two transpositions, giving necessary and sufficient conditions to find differentially 4-uniform permutations. Section 5 investigates the nonlinearity and the differential-linear uniformity of the permutations obtained by the proposed method and finally Section 6 shows numerical results and comparison with other previous constructions (Tables 1 to 4).
- Constructing new differentially 4-uniform permutations from the inverse function
- New differentially 4-uniform permutations by modifying the inverse function on subfields
- Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\)
- An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function
- New families of differentially 4-uniform permutations over \({\mathbb F}_{2^{2k}}\)
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- A method to calculate differential uniformity for permutations
- A new family of differentially 4-uniform permutations over \(\mathbb{F}_{2^{2k}}\) for odd \(k\)
- Binomial differentially 4 uniform permutations with high nonlinearity
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Constructing Differentially 4-Uniform Permutations Over <formula formulatype="inline"><tex Notation="TeX">${\BBF}_{2^{2k}}$</tex> </formula> via the Switching Method
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
- Constructing new differentially 4-uniform permutations from known ones
- Constructing new differentially 4-uniform permutations from the inverse function
- Differential uniformity of the composition of two functions
- Differentially 4-uniform bijections by permuting the inverse function
- DLCT: a new tool for differential-linear cryptanalysis
- Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\)
- scientific article; zbMATH DE number 5831605 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Involutory differentially 4-uniform permutations from known constructions
- More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)
- More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd
- New construction of differentially 4-uniform bijections
- New differentially 4-uniform permutations by modifying the inverse function on subfields
- New explicit constructions of differentially 4-uniform permutations via special partitions of \(\mathbb{F}_{2^{2 k}}\)
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
- On known and new differentially uniform functions
- On the construction of differentially 4-uniform involutions
- Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums
- Some binomial and trinomial differentially 4-uniform permutation polynomials
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- A method to calculate differential uniformity for permutations
- Bounds on differential and linear branch number of permutations
- Constructing new differentially 4-uniform permutations from known ones
- Constructing new differentially 4-uniform permutations from the inverse function
- Investigations of c-differential uniformity of permutations with Carlitz rank 3
- Doubly perfect nonlinear Boolean permutations
- An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function
- Differentially 4-uniform bijections by permuting the inverse function
- New differentially 4-uniform permutations by modifying the inverse function on subfields
- A new class of differential 4-uniform permutations from exponential permutation
- Low \(c\)-differential uniformity of the swapped inverse function in odd characteristic
- The second-order zero differential uniformity of the swapped inverse functions over finite fields
- Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\)
This page was built for publication: New differentially 4-uniform permutations from modifications of the inverse function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667074)
