More constructions of differentially 4-uniform permutations on F₂^2k

DOI10.1007/S10623-014-0006-XzbMATH Open1401.94239arXiv1309.7423OpenAlexW45261477MaRDI QIDQ5963363FDOQ5963363

Yin Tan, Longjiang Qu, Guang Gong, Chao Li

Publication date: 19 February 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Differentially 4-uniform permutations on $g{f}_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred functions, to construct a lot of infinite families of such permutations cite{QTTL}. In this paper, we propose a particular type of Boolean functions to characterize the preferred functions. On the one hand, such Boolean functions can be determined by solving linear equations, and they give rise to a huge number of differentially 4-uniform permutations over $g{f}_{2^{2k}}$. Hence they may provide more choices for the design of Substitution boxes. On the other hand, by investigating the number of these Boolean functions, we show that the number of CCZ-inequivalent differentially 4-uniform permutations over $g{f}_{2^{2k}}$ grows exponentially when $k$ increases, which gives a positive answer to an open problem proposed in cite{QTTL}.

Full work available at URL: https://arxiv.org/abs/1309.7423

zbMATH Keywords

substitution boxdifferentially 4-uniform permutationpreferred Boolean functionpreferred function

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25)

Cites Work

• A new almost perfect nonlinear function which is not quadratic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• On Known and New Differentially Uniform Functions
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Differential cryptanalysis of DES-like cryptosystems
• Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
• 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
• A matrix approach for constructing quadratic APN functions
• More constructions of APN and differentially 4-uniform functions by concatenation
• Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
• New Families of Differentially 4-Uniform Permutations over ${\mathbb F}_{2^{2k}}$
• A negative answer to Bracken-Tan-Tan's problem on differentially 4-uniform permutations over \(\mathbb F_2n\)
• Asymptotic nonlinearity of vectorial Boolean functions

Cited In (28)

• Involutory differentially 4-uniform permutations from known constructions
• Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
• Differentially low uniform permutations from known 4-uniform functions
• Vectorial Boolean functions with very low differential-linear uniformity using Maiorana-McFarland type construction
• New explicit constructions of differentially 4-uniform permutations via special partitions of \(\mathbb{F}_{2^{2 k}}\)
• Non-monomial permutations with differential uniformity six
• Low differentially uniform permutations from the Dobbertin APN function over \(\mathbb{F}_{2^n} \)
• On the behavior of some APN permutations under swapping points
• New differentially 4-uniform permutations from modifications of the inverse function
• On the boomerang uniformity of a class of permutation quadrinomials over finite fields
• On CCZ-equivalence between the Bracken-Tan-Tan function and power functions
• Implicit Quadratic Property of Differentially 4-Uniform Permutations
• A new method to investigate the CCZ-equivalence between functions with low differential uniformity
• Low \(c\)-differential and \(c\)-boomerang uniformity of the swapped inverse function
• On a class of APN power functions over odd characteristic finite fields: their differential spectrum and \(c\)-differential properties
• On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity
• Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
• An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function
• Ambiguity and deficiency for differentially 4-uniform monomial permutations on \(\mathbb{F}_{2^n}\)
• A method of construction of differentially 4-uniform permutations over \(V_m\) for even \(m\)
• On the boomerang uniformity of permutations of low Carlitz rank
• More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd
• New differentially 4-uniform permutations by modifying the inverse function on subfields
• A negative answer to Bracken-Tan-Tan's problem on differentially 4-uniform permutations over \(\mathbb F_2n\)
• Constructing differentially 4-uniform involutions over \(\mathbb{F}_{2^{2k}}\) by using Carlitz form
• A class of power mappings with low boomerang uniformity
• Constructing new differentially 4-uniform permutations from known ones
• On the construction of differentially 4-uniform involutions

Uses Software

• Camellia
• eSTREAM

This page was built for publication: More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963363)