Skip to content
Preprint

On a conjecture on the Kasami APN function: reductions, structure theorems, a proof for $k\bmod n\in\{1,2,n{-}2,n{-}1\}$, and exhaustive verification for $n\le 13$

Aug 2026 · 0 citations · 15 references
Mathematics

Abstract

We study Carlet's cyclic-additive conjecture for the Kasami almost perfect nonlinear (APN) function $F(x)=x^{4^k-2^k+1}$ on $GF(2^n)$, $\gcd(k,n)=1$: for the $2^{n-1}$-element set $\Delta=\{F(b)+F(b+1)+1: b\in GF(2^n)\}$ and all distinct nonzero $v_1,v_2\in GF(2^n)$, \[ \bigl|\{(x,y,z)\in\Delta^3 : v_1x+v_2y+(v_1+v_2)z=0\}\bigr| \;=\; 2^{2n-3}. \] This exact triple-count condition was first formulated by Carlet in his 2018 cyclic-additive difference-set framework; the Kasami instance was subsequently posed as an open problem at the NSUCRYPTO 2019 cryptographic olympiad, whose individual proposer was not publicly disclosed. We prove the conjecture for $k\bmod n\in\{1,2,n-2,n-1\}$, in particular a complete proof for $k=2$ ($d=13$) via a quadratic-form theory and an exact root-count reduction, and we verify it exhaustively by computer for every admissible $(n,k)$ with $n\le13$.

View source

Similar papers

Preprint Aug 2026

Resolving a conjecture on quadratic APN functions and a new quadratic $(n,n)$-function associated to crooked functions

We say an $(n,n)$-function $F \colon \mathbb{F}_2^n \to \mathbb{F}_2^n$ is a crooked function if for any nonzero $a \in \mathbb{F}_2^n$, the image of $D_aF(x)=F(x)+F(x+a)$ is an affine hyperplane. The only known examples of crooked functions are all quadratic almost perfect nonlinear (APN), or equivalently, for every k...

C. Carlet, Darrion Thornburgh · 1 citation · ⚡1
Preprint Sep 2026

Resolving a conjecture on permutation polynomials over $\mathbb{F}_{2^n}$

Let $\delta\in\mathbb{F}_{2^n}$ satisfy $\operatorname{Tr}_{\mathbb{F}_{2^n}/\mathbb{F}_2}(\delta)=1$. We study the permutation behavior of $$ f(x) = \left(\frac{1}{x^2+x+\delta}\right)^{2^k}+x $$ over $\mathbb{F}_{2^n}$. Helleseth and Zinoviev proved that $f(x)$ is a permutation for $k=0,1$, and remarked that numerica...

Yi Li · 0 citations
Preprint Aug 2026

Sieve dimension and search depth for the Erd\H{o}s-Straus conjecture, $n \equiv 1 \pmod{24}$

For primes $n\equiv1\pmod{24}$ we study how deep an explicit, factorization-free search for a decomposition of $4/n$ into three unit fractions has to go. Write $E_2(N;J)$ for the set of such primes $n\le N$ at which no witness of depth at most $J$ exists, in the sense of the two-parameter criterion of Theorem 3.9 with...

B. Dahan · 0 citations
Preprint Sep 2026

Proof of Almkvist's conjecture on the unimodality of partition polynomials

For integers $r\ge2$ and $n\ge1$, let $$ F_{r,n}(q)=\prod_{k=1}^{n}\frac{1-q^{rk}}{1-q^k}. $$ The coefficient of $q^j$ in \(F_{r,n}(q)\) counts partitions of $j$ into parts at most $n$, each occurring at most $r-1$ times. Hughes proved that $F_{2,n}(q)=\prod_{k=1}^{n}(1+q^k)$ is unimodal for every $n\ge 1$. This result...

Jian-Xi Mao, Wen-Le Shi, Bao-Xuan Zhu · 0 citations
Preprint Sep 2026

Polynomial Bohnenblust--Hille bounds for product of cyclic groups

Fix an integer $K\ge2$, and let $C_K^n =\{(e^{\frac{2\pi ij}{K}})_{j=0}^{K-1}\}^n$ be the product of cyclic groups of order $K$. For a Fourier character $\chi_\alpha$, let $s(\alpha)$ be the number of active coordinates. We give a self-contained proposed proof that the dimension-free Bohnenblust--Hille constants govern...

Joseph Slote, Alexander Volberg · 2 citations
Preprint Sep 2026

On the exponential sum over squarefree integers

Let $\mu$ be the M\"obius function and $e(t)=e^{2\pi it}$. We prove that if $N\ge2$, $\alpha\in\mathbb{R}$, $(a,q)=1$, and $|\alpha-a/q|\le q^{-2}$, then \[\bigg|\sum_{n\le N}\mu^2(n)e(\alpha n)\bigg|\ll\left(\frac Nq+q\right)(\log 2N)^5, \] with an absolute implied constant, and we deduce the corresponding estimate on...

Nicolas Robles, Alexandru Zaharescu, Dirk Zeindler · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.