Core Concepts
Bent functions play a crucial role in cryptography, with their connection to strongly regular graphs providing valuable insights.
Abstract
Abstract:
Bent functions are essential in cryptography.
Cayley graphs based on bent functions are strongly regular.
Introduction:
Cryptosystems involve encryption and decryption algorithms.
Private and public key algorithms like DES and AES are significant.
Preliminaries:
Definition of Boolean functions, linear, affine functions, and nonlinearity.
Bent functions defined by the minimum Hamming distance.
The Cayley graph Cay(Zn2, Ωf):
Definition of Cayley subsets and Cayley graphs.
Association of Boolean functions with Cayley graphs.
Strongly regular graphs:
Parameters of strongly regular graphs (v, k, λ, µ).
Spectrum determination based on parameters.
Vectorial bent function:
Introduction to vectorial bent functions.
Nonlinearity definitions for vectorial Boolean functions.
Conclusion:
Future works should explore extensions for odd n cases involving APN functions.
Stats
"The i-th eigenvalue λi of the Cayley graph... is given by λi = X x∈Zn2 (−1)Trn1(b(i)x)f(x) = 2nf ∗(b(i))."
"The largest spectral coefficient is λ0 = 2nf ∗(b(0)) = |Ωf|."
"If f is a bent function, the graph Gf is a strongly regular graph with λ = µ."