An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function
DOI10.1080/00207160.2016.1167884zbMATH Open1421.94045OpenAlexW2316734676MaRDI QIDQ4976324FDOQ4976324
Authors:
Publication date: 28 July 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1167884
Recommendations
- Constructing Differentially 4-Uniform Permutations Over <formula formulatype="inline"><tex Notation="TeX">${\BBF}_{2^{2k}}$</tex> </formula> via the Switching Method
- More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)
- Constructing new differentially 4-uniform permutations from the inverse function
- New secondary constructions of differentially 4-uniform permutations over \(\mathbb F_{2^{2k}}\)
- Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\)
- New explicit constructions of differentially 4-uniform permutations via special partitions of \(\mathbb{F}_{2^{2 k}}\)
- Construction of a class of differentially 4-uniform permutations
- New differentially 4-uniform permutations from modifications of the inverse function
- Involutory differentially 4-uniform permutations from known constructions
- Two classes of differentially 4-uniform permutations over \(\mathbb{F}_{2^n}\) with \(n\) even
APN functionsubstitution boxdifferentially 4-uniform permutationpreferred Boolean function4-uniform BFI
Cryptography (94A60) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- The Magma algebra system. I: The user language
- A new almost perfect nonlinear function which is not quadratic
- Binomial differentially 4 uniform permutations with high nonlinearity
- Constructing Differentially 4-Uniform Permutations Over <formula formulatype="inline"><tex Notation="TeX">${\BBF}_{2^{2k}}$</tex> </formula> via the Switching Method
- Constructing new differentially 4-uniform permutations from the inverse function
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- Differentially 4-uniform bijections by permuting the inverse function
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- More constructions of APN and differentially 4-uniform functions by concatenation
Cited In (9)
- Construction of a class of differentially 4-uniform permutations
- Differentially 4-uniform bijections by permuting the inverse function
- More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)
- New differentially 4-uniform permutations from modifications of the inverse function
- New families of differentially 4-uniform permutations over \({\mathbb F}_{2^{2k}}\)
- Combinatorial properties of differentially 2-uniform substitutions
- Calculation and construction of permutations with low differential uniformity over finite fields
- Ambiguity and deficiency for differentially 4-uniform monomial permutations on \(\mathbb{F}_{2^n}\)
- A new class of differential 4-uniform permutations from exponential permutation
This page was built for publication: An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976324)