A direct proof of APN-ness of the Kasami functions (Q2657130)

The Kasami function \(F:x\mapsto x^{2^{2k}-2^k+1}\) defined over \(\mathbb{F}_{2^n}\), with \(k\) such that \(\gcd(k,n)=1\), is an APN function. The APN property of the Kasami function has been obtained in [\textit{H. Janwa} and \textit{R. M. Wilson}, Lect. Notes Comput. Sci. 673, 180--194 (1993; Zbl 0798.94012)] studying some classes of cyclic codes and also in [\textit{H. Dobbertin}, NATO ASI Ser., Ser. C, Math. Phys. Sci. 542, 133--158 (1999; Zbl 0946.05010)] using some permutation polynomials. These types of proof are quite involved and difficult. In this work, the authors propose an alternative direct proof (for the case \(n\) odd) that involves some recent results on the solutions of the equation \(X^{2^k+1}+X+a=0\) over finite fields [\textit{K. H. Kim} and \textit{S. Mesnager}, Finite Fields Appl. 63, Article ID 101630, 15 p. (2020; Zbl 07174363)]. Indeed, for odd values of \(n\), the Kasami function \(F:x\mapsto x^{2^{2k}-2^k+1}\) can be written as \(F:x\mapsto x^{\frac{2^{3k}+1}{2^k+1}}\). Therefore, the number of solutions of the equation \((x+1)^{2^{2k}-2^k+1}+x^{2^{2k}-2^k+1}=b\) can be computed counting the solutions of the system \[ \begin{cases} X+Y=1\\ F(X)+F(Y)=b, \end{cases} \] that can be rewritten as \[ \begin{cases} x^{2^k+1}+y^{2^k+1}=1\\ x^{2^{3k}+1}+y^{2^{3k}+1}=b. \end{cases} \]