A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$

The existence of almost perfect nonlinear (APN) permutations operating on an even number of variables was a long-standing open problem, until an example with six variables was exhibited by Dillon et al. in 2009. However it is still unknown whether this example can be generalized to any even number of inputs. In a recent work, Perrin et al. described an infinite family of permutations, named butterflies, operating on $(4k+2)$ variables and with differential uniformity at most 4, which contains the Dillon APN permutation. In this paper, we generalize this family, and we completely solve the two open problems raised by Perrin et al. Indeed we prove that all functions in this larger family have the best known nonlinearity. We also show that this family does not contain any APN permutation besides the Dillon permutation, implying that all other functions have differential uniformity exactly four.

[1]  Robert Gold,et al.  Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[2]  Carl Bracken,et al.  A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree , 2009, Finite Fields Their Appl..

[3]  Mitsuru Matsui,et al.  Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.

[4]  Anne Canteaut,et al.  Almost Perfect Nonlinear functions , 2005 .

[5]  Mitsuru Matsui,et al.  The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.

[6]  Pascale Charpin,et al.  Sparse permutations with low differential uniformity , 2014, Finite Fields Their Appl..

[7]  Philippe Langevin Covering radius of RM (1, 9) in RM (3, 9) , 1990, EUROCODE.

[8]  Faruk Göloglu Almost perfect nonlinear trinomials and hexanomials , 2015, Finite Fields Their Appl..

[9]  Junhua Wu,et al.  Finite Fields and Their Applications , 2012 .

[10]  J. Davenport Editor , 1960 .

[11]  Alex Biryukov,et al.  Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem , 2016, CRYPTO.

[12]  Kaisa Nyberg,et al.  Links Between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities , 2014, IACR Cryptol. ePrint Arch..

[13]  Kaisa Nyberg,et al.  Differentially Uniform Mappings for Cryptography , 1994, EUROCRYPT.

[14]  Jie Peng,et al.  New explicit constructions of differentially 4-uniform permutations via special partitions of F22k , 2016, Finite Fields Their Appl..

[15]  Jakub Töpfer Links Between Differential and Linear Cryptanalysis , 2015 .

[16]  Eimear Byrne,et al.  Determining the Nonlinearity of a New Family of APN Functions , 2007, AAECC.

[17]  Peter L. Hammer,et al.  Boolean Models and Methods in Mathematics, Computer Science, and Engineering , 2010, Boolean Models and Methods.

[18]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[19]  Bo Zhu,et al.  Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions , 2016, Cryptography and Communications.

[20]  Lars R. Knudsen,et al.  Provable Security Against Differential Cryptanalysis , 1992, CRYPTO.

[21]  Gohar M. Kyureghyan Special Mappings of Finite Fields , 2013, Finite Fields and Their Applications.

[22]  Yongqiang Li,et al.  Constructing S-boxes for Lightweight Cryptography with Feistel Structure , 2014, CHES.

[23]  Anne Canteaut,et al.  On cryptographic properties of the cosets of R(1, m) , 2001, IEEE Trans. Inf. Theory.

[24]  Y. Tan,et al.  Constructing Differentially 4-Uniform Permutations Over via the Switching Method Longjiang Qu, Yin Tan, Chik How Tan, and Chao Li , 2013 .

[25]  Thierry P. Berger,et al.  On Almost Perfect Nonlinear Functions Over$mmb F_2^n$ , 2006, IEEE Transactions on Information Theory.

[26]  Gohar M. M. Kyureghyan,et al.  On inverses of APN exponents , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[27]  Yongqiang Li,et al.  Constructing differentially 4-uniform permutations over GF(22m) from quadratic APN permutations over GF(22m+1) , 2014, Des. Codes Cryptogr..

[28]  Elwyn R. Berlekamp,et al.  On the Solution of Algebraic Equations over Finite Fields , 1967, Inf. Control..

[29]  M. Walker,et al.  Cryptography and communications , 1996 .

[30]  Xiaohu Tang,et al.  Differentially 4-uniform bijections by permuting the inverse function , 2015, Des. Codes Cryptogr..

[31]  Lei Hu,et al.  Constructing new differentially 4-uniform permutations from the inverse function , 2014, Finite Fields Their Appl..

[32]  Yin Tan,et al.  More constructions of differentially 4-uniform permutations on F22k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\m , 2013, Designs, Codes and Cryptography.

[33]  Jacques Calmet,et al.  Algebraic Algorithms and Error-Correcting Codes , 1985, Lecture Notes in Computer Science.

[34]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[35]  Claude Carlet,et al.  Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems , 1998, Des. Codes Cryptogr..

[36]  Esen Aksoy On permutation polynomials over finite fields , 2006 .

[37]  Anne Canteaut,et al.  Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions , 2000, EUROCRYPT.