arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.11329math.COcs.ITmath.IT
收藏

关于一族双射影APN函数近期推广的研究

On a recent extension of a family of biprojective APN functions

Lukas Kölsch

AI总结:

本文研究Göloğlu双射影APN函数族的近期推广,证明其在3不整除m时等价于原族,在3整除m时给出不等价函数数量,并确定其最小像集大小和Walsh谱,解决了若干公开问题。

摘要:

APN函数作为对称密码学中的基本构件,在提供对差分攻击的最优抵抗性方面发挥着重要作用。本文考虑了Göloğlu近期在$\mathbb{F}_{2^{2m}}$上定义的一族双射影APN函数的推广。我们证明,当$3\nmid m$时,这一推广所产生的函数等价于Göloğlu的原始函数族。当$3|m$时,我们精确给出了这一新函数族所包含的不等价APN函数的数量。我们还证明该函数族具有APN函数的最小像集大小,并确定了其Walsh谱,从而解决了若干公开问题。在证明中,我们利用了Göloğlu与作者近期发展的群论技巧,并结合了射影多项式集合上的群作用。

英文摘要:

APN functions play a big role as primitives in symmetric cryptography as building blocks that yield optimal resistance to differential attacks. In this note, we consider a recent extension of a biprojective APN family by Göloğlu defined on $\mathbb{F}_{2^{2m}}$. We show that this generalization yields functions equivalent to Göloğlu's original family if $3\nmid m$. If $3|m$ we show exactly how many inequivalent APN functions this new family contains. We also show that the family has the minimal image set size for an APN function and determine its Walsh spectrum, hereby settling some open problems. In our proofs, we leverage a group theoretic technique recently developed by Göloğlu and the author in conjunction with a group action on the set of projective polynomials.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑