Graph eigenvalues and Walsh spectrum of Boolean functions
MetadataShow full item record
In this paper, we consider te Cayley graph Gf associated with a Boolean function f and we use it to investigate some of the cryptographic properties of f. We derive necessary (but not sufficient) conditions for a Boolean function to be bent. We also gind a complete characterization of the propagation characteristics of f using the topology of its associated Cayley graph Gf. Finally, some inequalities between the cardinality of the spectrum of Gf and the Hamming weight of f are obtained, and some problems are raised.
Showing items related by title, author, creator and subject.
Correlation immunity, avalanche features, and other cryptographic properties of generalized Boolean functions Martinsen, Thor (Monterey, California: Naval Postgraduate School, 2017-09);This dissertation investigates correlation immunity, avalanche features, and the bent cryptographic properties for generalized Boolean functions defined on Vn with values in Zԛ. We extend the concept of correlation immunity ...
Chung, Jong Ho (Monterey, California: Naval Postgraduate School, 2013-09);In this thesis, we study a type of affine equivalence for the monomial rotation-symmetric (MRS) Boolean func-tions and two new construction techniques for cryptographic Boolean functions based on the affine equivalence of ...
O'Dowd, Timothy R. (Monterey, California. Naval Postgraduate School, 2010-12);Linear cryptanalysis attacks are a threat against cryptosystems. These attacks can be defended against by using combiner functions composed of highly nonlinear Boolean functions. Bent functions, which have the highest ...