Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bent functions and strongly regular graphs (2212.11325v2)

Published 21 Dec 2022 in cs.IT, math.CO, and 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 $\mathbb{Z}_{2}{n}$ by the support of a bent function is a strongly regular graph $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)$-bent functions $F=(f_1,\ldots,f_m)$, involving the support of their components $f_i$, and their $n$-ary symmetric differences.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com