A lower bound on the number of inequivalent APN functions

被引：1

作者：

Kaspers, Christian ^{[1
]}

Zhou, Yue ^{[2
]}

机构：

[1] Otto von Guericke Univ, Inst Algebra & Geometry, D-39106 Magdeburg, Germany

[2] Natl Univ Def Technol, Dept Math, Changsha 410073, Peoples R China

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 2022年 / 186卷

基金：

中国国家自然科学基金;

关键词：

APN function; Vectorial Boolean function; CCZ-equivalence; EA-equivalence; EQUIVALENCES; PERMUTATION;

D O I：

10.1016/j.jcta.2021.105554

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 [22], which depend on three parameters k, s and alpha, are pairwise inequivalent for distinct choices of the parameters k and s. Moreover, we determine the automorphism group of these APN functions. (C) 2021 Elsevier Inc. All rights reserved.

引用

页数：38

共 22 条

[1] Determining the Walsh spectra of Taniguchi's and related APN-functions [J].