A generalisation of Dillon's APN permutation with the best known differential and linear properties for all fields of size $2^{4k+2}$

Anne Canteaut (1) , Sébastien Duval (2, 1, 3) , Léo Perrin (4)

1 SECRET - Security, Cryptology and Transmissions
2 SU - Sorbonne Université
3 UPMC - Université Pierre et Marie Curie - Paris 6
4 SnT - Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg]

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 generalised 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 generalise 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 non-linearity. 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.

Mots clés: Boolean function; Sbox; APN; differential uniformity; nonlinearity

Domaines: Cryptographie et sécurité [cs.CR]

Anne Canteaut, Sébastien Duval, Léo Perrin. A generalisation of Dillon's APN permutation with the best known differential and linear properties for all fields of size $2^{4k+2}$. [Research Report] 2016/887, IACR Cryptology ePrint Archive. 2016, pp.29. ⟨hal-01401245⟩