Bent functions and strongly regular graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909132827656192 |
|---|---|
| author | Smaldore, Valentino |
| author_facet | Smaldore, Valentino |
| contents | The family of bent functions is a known class of Boolean functions, which have a great importance in cryptography. The Cayley graph defined on $\mathbb{Z}_{2}^{n}$ by the support of a bent function is a strongly regular graph $srg(v,kλ,μ)$, with $λ=μ$. In this note we list the parameters of such Cayley graphs. Moreover, it is given a condition on $(n,m)$-bent functions $F=(f_1,\ldots,f_m)$, involving the support of their components $f_i$, and their $n$-ary symmetric differences. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_11325 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Bent functions and strongly regular graphs Smaldore, Valentino Information Theory Combinatorics 94D10, 05E30 The family of bent functions is a known class of Boolean functions, which have a great importance in cryptography. The Cayley graph defined on $\mathbb{Z}_{2}^{n}$ by the support of a bent function is a strongly regular graph $srg(v,kλ,μ)$, with $λ=μ$. In this note we list the parameters of such Cayley graphs. Moreover, it is given a condition on $(n,m)$-bent functions $F=(f_1,\ldots,f_m)$, involving the support of their components $f_i$, and their $n$-ary symmetric differences. |
| title | Bent functions and strongly regular graphs |
| topic | Information Theory Combinatorics 94D10, 05E30 |
| url | https://arxiv.org/abs/2212.11325 |