Bent functions and strongly regular graphs

12/21/2022
by   Valentino Smaldore, et al.
0

The family of bent functions is a known class of Boolean functions, which have a great importance in cryptography. The Cayley graph defined on ℤ_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,…,f_m), involving the support of their components f_i, and their n-ary symmetric differences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2018

A complete characterization of plateaued Boolean functions in terms of their Cayley graphs

In this paper we find a complete characterization of plateaued Boolean f...
research
07/13/2022

On the Complexity of Identifying Strongly Regular Graphs

In this note, we show that Graph Isomorphism (GI) is not ^0-reducible to...
research
09/10/2018

Strongly regular graphs from weakly regular plateaued functions

The paper provides the first constructions of strongly regular graphs an...
research
06/20/2018

Generalized bent Boolean functions and strongly regular Cayley graphs

In this paper we define the (edge-weighted) Cayley graph associated to a...
research
11/14/2018

Regular subgroups with large intersection

In this paper we study the relationships between the elementary abelian ...
research
07/29/2019

Enumeration of regular graphs by using the cluster in high efficiency

In this note, we proposed a method to enumerate regular graphs on the cl...

Please sign up or login with your details

Forgot password? Click here to reset