Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …

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

The lengths of binary Golay complementary pairs are limited to 2 α 10 β 26 γ, where α, ß,
γ∈{0, 1, 2,...}. This weakness is repaired by the Z-complementary pairs (ZCPs). In this letter …

Minimal linear codes have important applications in secret sharing schemes and secure
multi-party computation, etc. In this paper, we study the minimality of a kind of linear codes …

Finding and constructing Boolean functions with many cryptographic properties to resist a
variety of existing attacks are challenging tasks in current cryptography and information …

In this paper, we give an efficient method for constructing a large set of disjoint spectra
functions without linear structures, which are not equivalent to partially linear functions. This …

In this paper, the properties of symbol transformations of cyclic Hadamard matrices are
studied. An infinite class of (n− 1)-variable 2-resilient rotation symmetric Boolean functions …

Whereas the design and properties of bent and plateaued functions have been frequently
addressed during the past few decades, there are only a few design methods of the so …

In this article we improve the lower bound on the maximum nonlinearity of 1-resilient
Boolean functions, for n even, by proposing a method of constructing this class of functions …

The first and the third authors recently introduced a spectral construction of plateaued and of
5-value spectrum functions. In particular, the design of the latter class requires a …