当前位置:
X-MOL 学术
›
J. Comb. Theory A
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
A lower bound on the number of inequivalent APN functions
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2021-10-14 , DOI: 10.1016/j.jcta.2021.105554 Christian Kaspers , Yue Zhou
中文翻译:
不等价 APN 函数数量的下限
更新日期:2021-10-15
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2021-10-14 , DOI: 10.1016/j.jcta.2021.105554 Christian Kaspers , Yue Zhou
In this paper, we establish a lower bound on the total number of inequivalent APN functions on the finite field with 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 α, are pairwise inequivalent for distinct choices of the parameters k and s. Moreover, we determine the automorphism group of these APN functions.
中文翻译:
不等价 APN 函数数量的下限
在本文中,我们建立了有限域上不等价 APN 函数总数的下界,其中 元素,其中m是偶数。我们通过证明 Pott 和第二作者 [22] 引入的 APN 函数(依赖于三个参数k、s和α )对于参数k和s 的不同选择是成对不等价的,从而获得了这个结果。此外,我们确定了这些 APN 函数的自同构群。