{"title":"Resolution of the exceptional APN conjecture in the Gold degree case","authors":"Carlos Agrinsoni, Heeralal Janwa, Moises Delgado","doi":"10.1007/s10623-025-01607-x","DOIUrl":null,"url":null,"abstract":"<p>A function <span>\\(f: {\\mathbb {F}}_q \\rightarrow {\\mathbb {F}}_q\\)</span>, is called an <i>almost perfect nonlinear </i> (APN) if <span>\\(f(X+a)-f(X) =b\\)</span> has at most 2 solutions for every <span>\\(b,a \\in {\\mathbb {F}}_q\\)</span>, with <i>a</i> nonzero. Furthermore, it is called an exceptional APN if it is an APN on infinitely many extensions of <span>\\({\\mathbb {F}}_q\\)</span>. These problems are equivalent to finding rational points on the corresponding variety <span>\\({\\mathcal {X}}_f:=\\phi _f(X,Y,Z)=0\\)</span>. The Lang–Weil, Deligne, and Ghorpade–Lachaud bounds help solve these problems when <span>\\(\\phi _f\\)</span> contains an absolutely irreducible factor in the defining field. The exceptional monomial APN functions had been classified up to CCZ equivalence by Hernando and McGuire (J Algebra 343:78–92, 2011), proving the conjecture of Janwa, Wilson, and McGuire (JMW) (1993, 1995). The main tools used were the computation and classification of the singularities of <span>\\({\\mathcal {X}}_f\\)</span> and the algorithm of JMW for the absolute irreducibility testing using Bezout’s Theorem. Aubry et al. (2010) conjectured that the only exceptional APN functions of odd degree up to CCZ equivalence are the Gold <span>\\((2^k+1)\\)</span> and the Kasami-Welch <span>\\((2^{2k}-2^k+1)\\)</span> monomial functions. Here, we settle the first case (Theorem 20). We also prove a part of a conjecture on exceptional crooked functions. One of the main tools in our proofs is our new absolute irreducibility criterion (Theorem 9).</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"22 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-025-01607-x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
A function \(f: {\mathbb {F}}_q \rightarrow {\mathbb {F}}_q\), is called an almost perfect nonlinear (APN) if \(f(X+a)-f(X) =b\) has at most 2 solutions for every \(b,a \in {\mathbb {F}}_q\), with a nonzero. Furthermore, it is called an exceptional APN if it is an APN on infinitely many extensions of \({\mathbb {F}}_q\). These problems are equivalent to finding rational points on the corresponding variety \({\mathcal {X}}_f:=\phi _f(X,Y,Z)=0\). The Lang–Weil, Deligne, and Ghorpade–Lachaud bounds help solve these problems when \(\phi _f\) contains an absolutely irreducible factor in the defining field. The exceptional monomial APN functions had been classified up to CCZ equivalence by Hernando and McGuire (J Algebra 343:78–92, 2011), proving the conjecture of Janwa, Wilson, and McGuire (JMW) (1993, 1995). The main tools used were the computation and classification of the singularities of \({\mathcal {X}}_f\) and the algorithm of JMW for the absolute irreducibility testing using Bezout’s Theorem. Aubry et al. (2010) conjectured that the only exceptional APN functions of odd degree up to CCZ equivalence are the Gold \((2^k+1)\) and the Kasami-Welch \((2^{2k}-2^k+1)\) monomial functions. Here, we settle the first case (Theorem 20). We also prove a part of a conjecture on exceptional crooked functions. One of the main tools in our proofs is our new absolute irreducibility criterion (Theorem 9).
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.