More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd (Q2193394)

Summary: Permutations with low differential uniformity, high algebraic degree, and high nonlinearity over \(\mathbb{F}_{2^{2 k}}\) can be used as the substitution boxes for many block ciphers. In this paper, several classes of low differential uniformity permutations are constructed based on the method of choosing two permutations over \(\mathbb{F}_{2^{2 k}}\) to get the desired permutations. The resulted low differential uniformity permutations have high algebraic degrees and nonlinearities simultaneously, which provide more choices for the substitution boxes. Moreover, some numerical examples are provided to show the efficacy of the theoretical results.