English

Linearly Self-Equivalent APN Permutations in Small Dimension

Information Theory 2021-06-28 v3 Combinatorics math.IT

Abstract

All almost perfect nonlinear (APN) permutations that we know to date admit a special kind of linear self-equivalence, i.e., there exists a permutation GG in their CCZ-equivalence class and two linear permutations AA and BB, such that GA=BGG \circ A = B \circ G. After providing a survey on the known APN functions with a focus on the existence of self-equivalences, we search for APN permutations in dimension 6, 7, and 8 that admit such a linear self-equivalence. In dimension six, we were able to conduct an exhaustive search and obtain that there is only one such APN permutation up to CCZ-equivalence. In dimensions 7 and 8, we performed an exhaustive search for all but a few classes of linear self-equivalences and we did not find any new APN permutation. As one interesting result in dimension 7, we obtain that all APN permutation polynomials with coefficients in F2\mathbb{F}_2 must be (up to CCZ-equivalence) monomial functions.

Cite

@article{arxiv.2003.12006,
  title  = {Linearly Self-Equivalent APN Permutations in Small Dimension},
  author = {Christof Beierle and Marcus Brinkmann and Gregor Leander},
  journal= {arXiv preprint arXiv:2003.12006},
  year   = {2021}
}

Comments

30 pages. This is the version accepted to IEEE Transactions on Information Theory. The final published version is going to appear and can be found under the provided DOI

R2 v1 2026-06-23T14:28:20.682Z