Constructing differentially 4-uniform involutions over \(\mathbb{F}_{2^{2k}}\) by using Carlitz form
From MaRDI portal
Publication:2066384
DOI10.1016/J.FFA.2021.101957zbMath1481.94108OpenAlexW3217203397MaRDI QIDQ2066384
Soonhak Kwon, Jaeseong Jeong, Namhun Koo
Publication date: 14 January 2022
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2021.101957
nonlinearityinvolutiondifferentially 4-uniform permutationdifferential uniformityalgebraic degreesubstitution box (S-box)Carlitz rank
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (06E30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New explicit constructions of differentially 4-uniform permutations via special partitions of \(\mathbb{F}_{2^{2 k}}\)
- Binomial differentially 4 uniform permutations with high nonlinearity
- Differentially 4-uniform bijections by permuting the inverse function
- New differentially 4-uniform permutations by modifying the inverse function on subfields
- On the Carlitz rank of permutation polynomials
- Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\)
- On the cycle structure of permutation polynomials
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- A method to calculate differential uniformity for permutations
- Involutory differentially 4-uniform permutations from known constructions
- Two classes of differentially 4-uniform permutations over \(\mathbb{F}_{2^n}\) with \(n\) even
- On the boomerang uniformity of permutations of low Carlitz rank
- Differential uniformity of the composition of two functions
- More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd
- 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
- Permutations of finite fields with prescribed properties
- On the construction of differentially 4-uniform involutions
- Constructing new differentially 4-uniform permutations from the inverse function
- A new family of differentially 4-uniform permutations over \(\mathbb{F}_{2^{2k}}\) for odd \(k\)
- Some Binomial and Trinomial Differentially 4-Uniform Permutation Polynomials
- Involutions Over the Galois Field
- New Construction of Differentially 4-Uniform Bijections
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- New secondary constructions of differentially 4-uniform permutations over
- Boolean Functions for Cryptography and Coding Theory
- 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}}\)
This page was built for publication: Constructing differentially 4-uniform involutions over \(\mathbb{F}_{2^{2k}}\) by using Carlitz form