Carlet’s cyclic-additive conjecture for Kasami monomials

For every positive integer nn, every positive integer kk with gcd⁡(k,n)=1\gcd(k,n)=1, and every finite field KK of characteristic 22 with ∣K∣=2n|K|=2^n, let dk=4k−2k+1d_k=4^k-2^k+1 and Δk={(b+1)dk+bdk+1:b∈K}\Delta_k=\{(b+1)^{d_k}+b^{d_k}+1:b\in K\}. Then, for all distinct nonzero v1,v2∈Kv_1,v_2\in K, one has ∣{(x,y,z)∈Δk3:v1x+v2y+(v1+v2)z=0}∣=22n−3\left|\{(x,y,z)\in\Delta_k^3:v_1x+v_2y+(v_1+v_2)z=0\}\right|=2^{2n-3}.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

An October 2026 unrefereed paper claims a complete proof of the conjecture, with a formalized proof, but independent verification is absent.

Carlet formulated the cyclic-additive difference-set condition in 2018; the Kasami-family case was posed as an open problem at the NSUCRYPTO 2019 olympiad. The conjecture asks for a specific incidence count for every admissible Kasami parameter.

Known results

  • Carlet, 2018: formulated the cyclic-additive condition.
  • Nagy, McNeil, and Vajda, August 19, 2026: proved the conjecture for k mod n∈{1,2,n−2,n−1}k\bmod n\in\{1,2,n-2,n-1\}, including the Kasami exponent d=13d=13.
  • The same preprint exhaustively verified all admissible (n,k)(n,k) with n≤13n\le 13.

October 2026 claimed proof

Nagy, McNeil, and Vajda now claim the required incidence count for all admissible parameters, using twisted root counts and an incidence argument on a Fermat cubic, with Lean formalization. The claim is presented in an unrefereed preprint.

Current status (as of October 2026): The conjecture is claimed solved for all admissible parameters, but the new proof and its formalization have not undergone independent mathematical verification.

Sources

Solutions 0

No solutions have been posted yet.