English

A lower bound on the number of inequivalent APN functions

Combinatorics 2020-02-05 v2 Information Theory math.IT

Abstract

In this paper, we establish a lower bound on the total number of inequivalent APN functions on the finite field with 22m2^{2m} elements, where mm is even. We obtain this result by proving that the APN functions introduced by Pott and the second author, that depend on three parameters kk, ss and α\alpha, are pairwise inequivalent for distinct choices of the parameters kk and ss. Moreover, we determine the automorphism group of these APN functions.

Keywords

Cite

@article{arxiv.2002.00673,
  title  = {A lower bound on the number of inequivalent APN functions},
  author = {Christian Kaspers and Yue Zhou},
  journal= {arXiv preprint arXiv:2002.00673},
  year   = {2020}
}

Comments

34 Pages