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

Bent Functions: Results and Applications to Cryptography offers a unique survey of the
objects of discrete mathematics known as Boolean bent functions. As these maximal …

Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

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 …

Boolean functions are mathematical objects used in diverse domains and have been
actively researched for several decades already. One domain where Boolean functions play …

Boolean functions have numerous applications in domains as diverse as coding theory,
cryptography, and telecommunications. Heuristics play an important role in the construction …

Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial
optimization problem, since they must satisfy several properties to resist cryptanalytic …

The objective of this article is to broaden the understanding of the connections between bent
functions and partial difference sets. Recently, the first two authors showed that the elements …

Caroline Melles: clarify definitions of various graph types (weighted graphs, multigraphs,
and weighted multigraphs); clarify definitions of degree, isolated vertices, and pendant and …