Boolean functions are perhaps the most basic objects of study in theoretical computer
science. They also arise in other areas of mathematics, including combinatorics, statistical …

A fundamental objective of cryptography is to enable two persons to communicate over an
insecure channel (a public channel such as the internet) in such a way that any other person …

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 …

Spectral techniques facilitate the design and testing of today's increasingly complex digital
devices There is heightened interest in spectral techniques for the design of digital devices …

We analyze the complexity of learning $ n $-qubit quantum phase states. A degree-$ d $
phase state is defined as a superposition of all $2^ n $ basis vectors $ x $ with amplitudes …

Decision diagram (DD) techniques are very popular in the electronic design automation
(EDA) of integrated circuits, and for good reason. They can accurately simulate logic design …

We investigate the boundary between classical and quantum computational power. This
work consists of two parts. First we develop new classical simulation algorithms that are …