Bent functions and strongly regular graphs

arXiv2212.11325MaRDI QIDQ6507380FDOQ6507380

Authors: Valentino Smaldore 

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 $mathbb{Z}_2^n$ by the support of a bent function is a strongly regular graph $srg(v,klambda,mu)$, with $lambda=mu$. 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.

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Boolean functions (94D10)

This page was built for publication: Bent functions and strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507380)