Cryptographic Boolean Functions and Applications, Second Edition is designed to be a
comprehensive reference for the use of Boolean functions in modern cryptography. While …

Boolean bent functions have been introduced by Rothaus in 1966, bent functions in odd
characteristic were first considered in 1985 by Kumar, Scholtz, and Welch. Two books on …

W. David Joyner Caroline Grant Melles Page 1 Applied and Numerical Harmonic Analysis W.
David Joyner Caroline Grant Melles Adventures in Graph Theory Page 2 Page 3 Applied and …

This paper investigates relationship between algebraic expressions and graphs. Our intent
is to simplify graph expressions and eventually find their shortest representations. We prove …

In this paper we define the (edge-weighted) Cayley graph associated to a generalized
Boolean function, introduce a notion of strong regularity and give several of its properties …

Over a period of several years, the authors tried to generalize the Dillon and Bernasconi
etal. characterizations of Boolean bent functions to the p-ary case, with …

Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions
which guarantee that a $ p $-ary function in an even number of variables is bent, for $ p $ a …

In this paper we define the (edge-weighted) Cayley graph associated to a generalized
Boolean function, introduce a notion of strong regularity and give several of its proper-ties …