A lower bound on the number of inequivalent APN functions

02/03/2020 ∙ by Christian Kaspers, et al. ∙ 0

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

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.