On the Walsh spectra of quadratic APN functions
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911691328978944 |
|---|---|
| author | Bénéteau, Sophie Hannah Goluboff, Nicolas Kölsch, Lukas Vaghasiya, Divyesh |
| author_facet | Bénéteau, Sophie Hannah Goluboff, Nicolas Kölsch, Lukas Vaghasiya, Divyesh |
| contents | APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is directly related to the Walsh spectrum of the function. In this paper, we establish two novel connections that allow us to derive strong conditions on the Walsh spectra of quadratic APN functions. We prove that the Walsh transform of a quadratic APN function $F$ operating on $n=2k$ bits is uniquely associated with a vector space partition of $\mathbb{F}_2^n$ and a specific blocking set in the corresponding projective space $PG(n-1,2)$. These connections allow us to prove a variety of results on the Walsh spectrum of $F$. We prove for instance that $F$ can have at most one component function of amplitude larger than $2^{3n/4}$. We also find the first nontrivial upper bound on the number of bent component functions of a quadratic APN function, and provide conditions for a function to be CCZ-equivalent to a permutation based on its number of bent components. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_12008 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Walsh spectra of quadratic APN functions Bénéteau, Sophie Hannah Goluboff, Nicolas Kölsch, Lukas Vaghasiya, Divyesh Combinatorics Information Theory 11T71, 06E30, 94A60 APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is directly related to the Walsh spectrum of the function. In this paper, we establish two novel connections that allow us to derive strong conditions on the Walsh spectra of quadratic APN functions. We prove that the Walsh transform of a quadratic APN function $F$ operating on $n=2k$ bits is uniquely associated with a vector space partition of $\mathbb{F}_2^n$ and a specific blocking set in the corresponding projective space $PG(n-1,2)$. These connections allow us to prove a variety of results on the Walsh spectrum of $F$. We prove for instance that $F$ can have at most one component function of amplitude larger than $2^{3n/4}$. We also find the first nontrivial upper bound on the number of bent component functions of a quadratic APN function, and provide conditions for a function to be CCZ-equivalent to a permutation based on its number of bent components. |
| title | On the Walsh spectra of quadratic APN functions |
| topic | Combinatorics Information Theory 11T71, 06E30, 94A60 |
| url | https://arxiv.org/abs/2510.12008 |