Classification of power-of-two-sized k-covers

Prove or disprove that every k-cover S⊆F_2^n with |S|=2^{n/2} is affinely equivalent to the graph of an almost bent function F:F_2^{n/2}→F_2^{n/2}.

Background

The paper proves that if a Sidon set S of affine dimension n has size 2{n/2}, then γ_S is bent if and only if S is a k-cover. Graphs of almost bent functions provide examples of such k-covers, but it is unresolved whether all k-covers of this size arise from almost bent functions up to affine equivalence.

The authors formulate the unresolved classification as a conjecture asserting that every such k-cover is affinely equivalent to the graph of an almost bent function.

References

As previously mentioned, graphs of AB functions satisfy this, but it is unknown if there exist k-covers of this same size that are not graphs of AB functions.

On generalizing cryptographic results to Sidon sets in $\mathbb{F}_2^n$  (2501.11184 - Thornburgh, 19 Jan 2025) in Section 3, paragraph immediately preceding Conjecture 3.? and the displayed Conjecture environment