English

Bent functions and strongly regular graphs

Information Theory 2024-03-12 v2 Combinatorics math.IT

Abstract

The family of bent functions is a known class of Boolean functions, which have a great importance in cryptography. The Cayley graph defined on Z2n\mathbb{Z}_{2}^{n} by the support of a bent function is a strongly regular graph srg(v,kλ,μ)srg(v,k\lambda,\mu), with λ=μ\lambda=\mu. In this note we list the parameters of such Cayley graphs. Moreover, it is given a condition on (n,m)(n,m)-bent functions F=(f1,,fm)F=(f_1,\ldots,f_m), involving the support of their components fif_i, and their nn-ary symmetric differences.

Keywords

Cite

@article{arxiv.2212.11325,
  title  = {Bent functions and strongly regular graphs},
  author = {Valentino Smaldore},
  journal= {arXiv preprint arXiv:2212.11325},
  year   = {2024}
}
R2 v1 2026-06-28T07:47:42.887Z