The APN distance-one conjecture

Let n3n\geq 3, and let F,G ⁣:F2nF2nF,G\colon\mathbb{F}_2^n\to\mathbb{F}_2^n be APN functions. Define their Hamming distance by

d(F,G)={xF2n:F(x)G(x)}.d(F,G)=\left|\left\{x\in\mathbb{F}_2^n:F(x)\neq G(x)\right\}\right|.

APN distance-one conjecture. If FGF\neq G, then d(F,G)>1d(F,G)>1. It is unknown whether two APN functions can have Hamming distance one; the conjecture is known for several classes, including known APN power functions except the Dobbertin function and APN plateaued functions.

Sources & referencesView supporting material

Primary source

Maria Mihaila and Darrion Thornburgh, “On lower bounds for the distances between APN functions”, arXiv:2509.02280 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.