Litcius/Paper detail

Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application

Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stănică

2020IEEE Transactions on Information Theory17 citationsDOI

Abstract

For a function $f$ from $\mathbb {F}_{2}^{n}$ to $\mathbb {F}_{2}^{n}$ , the planarity of $f$ is usually measured by its differential uniformity and differential spectrum. In this paper, we propose the concept of vanishing flats, which supplies a combinatorial viewpoint on the planarity. First, the number of vanishing flats of $f$ can be regarded as a measure of the distance between $f$ and the set of almost perfect nonlinear functions. In some cases, the number of vanishing flats serves as an “intermediate” concept between differential uniformity and differential spectrum, which contains more information than differential uniformity, however less than the differential spectrum. Secondly, the set of vanishing flats forms a combinatorial configuration called partial quadruple system, since it conveys a detailed structural information about $f$ . We initiate this study by considering the number of vanishing flats and the partial quadruple systems associated with monomials and Dembowski-Ostrom polynomials. In addition, we present an application of vanishing flats to the partition of a vector space into disjoint equidimensional affine spaces. We conclude the paper with several further questions and challenges.

Topics & Concepts

Planarity testingComputer scienceMathematicsTheoretical computer scienceCombinatoricsAlgorithmCoding theory and cryptographygraph theory and CDMA systemsAdvanced Combinatorial Mathematics
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application | Litcius