On generalizing cryptographic results to Sidon sets in $\mathbb{F}_2^n$
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916572416704512 |
|---|---|
| author | Thornburgh, Darrion |
| author_facet | Thornburgh, Darrion |
| contents | A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that $x+y=z+w$ has no solutions $x,y,z,w \in S$ with $x,y,z,w$ all distinct. In this paper, we prove various results on Sidon sets by using or generalizing known cryptographic results. In particular, we generalize known results on the Walsh transform of almost perfect nonlinear (APN) functions to Sidon sets. One such result is that we classify Sidon sets with minimal linearity as those that are $k$-covers. That is, Sidon sets with minimal linearity are those Sidon sets $S \subseteq \mathbb{F}_2^n$ such that there exists $k > 0$ such that for any $p \in \mathbb{F}_2^n \setminus S$, there are exactly $k$ subsets $\{x,y,z\} \subseteq S$ such that $x+y+z = p$. From this, we also classify $k$-covers by means of the Cayley graph of a particular Boolean function, and we construct the unique rank $3$ strongly regular graph with parameters $(2048, 276, 44, 36)$ as the Cayley graph of a Boolean function. Finally, by computing the linearity of a particular family of Sidon sets, we increase the best-known lower bound of the largest Sidon set in $\mathbb{F}_2^{4t+1}$ by $1$ for all $t \geq 4$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11184 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On generalizing cryptographic results to Sidon sets in $\mathbb{F}_2^n$ Thornburgh, Darrion Combinatorics 11B13, 94D10 (Primary) 05E30 (Secondary) A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that $x+y=z+w$ has no solutions $x,y,z,w \in S$ with $x,y,z,w$ all distinct. In this paper, we prove various results on Sidon sets by using or generalizing known cryptographic results. In particular, we generalize known results on the Walsh transform of almost perfect nonlinear (APN) functions to Sidon sets. One such result is that we classify Sidon sets with minimal linearity as those that are $k$-covers. That is, Sidon sets with minimal linearity are those Sidon sets $S \subseteq \mathbb{F}_2^n$ such that there exists $k > 0$ such that for any $p \in \mathbb{F}_2^n \setminus S$, there are exactly $k$ subsets $\{x,y,z\} \subseteq S$ such that $x+y+z = p$. From this, we also classify $k$-covers by means of the Cayley graph of a particular Boolean function, and we construct the unique rank $3$ strongly regular graph with parameters $(2048, 276, 44, 36)$ as the Cayley graph of a Boolean function. Finally, by computing the linearity of a particular family of Sidon sets, we increase the best-known lower bound of the largest Sidon set in $\mathbb{F}_2^{4t+1}$ by $1$ for all $t \geq 4$. |
| title | On generalizing cryptographic results to Sidon sets in $\mathbb{F}_2^n$ |
| topic | Combinatorics 11B13, 94D10 (Primary) 05E30 (Secondary) |
| url | https://arxiv.org/abs/2501.11184 |