New differentially 4-uniform permutations by modifying the inverse function on subfields

Abstract

Permutations over \(\mathbb {F}_{2^{2k}}\) with low differential uniformity, high algebraic degree and high nonlinearity are of great cryptographic importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers with SPN (Substitution Permutation Network) structure. A well known example is that the S-box of the famous Advanced Encryption Standard (AES) is derived from the inverse function on \(\mathbb {F}_{2^{8}}\) , which has been proved to be a differentially 4-uniform permutation with the optimal algebraic degree and known best nonlinearity. Recently, Zha et al. proposed two constructions of differentially 4-uniform permutations over \(\mathbb {F}_{2^{2k}}\) , say G _t and G _{s, t} with T r(s ⁻¹) = 1, by applying affine transformations to the inverse function on some subfields of \(\mathbb {F}_{2^{2k}}\) (Zha et al. Finite Fields Appl. 25, 64–78, 2014). In this paper, we generalize their method by applying other types of EA (extended affine) equivalent transformations to the inverse function on some subfields of \(\mathbb {F}_{2^{2k}}\) and present two new constructions of differentially 4-uniform permutations, say F _α and F _{β, α} with T r(β ⁻¹) = 1. Furthermore, we prove that all the functions G _t with different t are CCZ (Carlet-Charpin-Zinoviev) equivalent to our subclass F ₀, while all the functions G _{s, t} with different t are CCZ-equivalent to our subclass F _s,0. In addition, both our two constructions give many new CCZ-inequivalent classes of such functions, as checked by computer in small numbers of variables. Moreover, all these newly constructed permutations are proved to have the optimal algebraic degree and high nonlinearity.

from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2lohQvD
via IFTTT