Nonvanishing $k$-flats of Boolean and vectorial functions
This work addresses a theoretical problem in cryptography and coding theory for researchers studying Boolean functions, but it appears incremental as it builds on known generalizations of APN functions.
The paper tackled the problem of studying nonvanishing flats in Boolean functions by introducing a new combinatorial technique, which enabled the determination of nonvanishing flats for an infinite family and proved that certain sum-free functions generate others, implying the existence of millions of such functions.
$k$th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to study the nonvanishing flats of Boolean functions. This approach allows us to determine the number of nonvanishing flats for an infinite family of Boolean functions. We moreover use it to show that any $k$th-order sum-free $(n,n)$-function of algebraic degree $k$ gives rise to an $(n-k)$th-order sum-free $(n,n)$-function of algebraic degree $n-k$. This implies the existence of millions of $(n-2)$th-order sum-free functions.