The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …

The complexity of planning and scheduling is determined by the degree to which activities
contend for resources. Accordingly this requires any application to have the ability to reason …

Parker considered a new type of discrete Fourier transform, called nega-Hadamard
transform. We prove several results regarding its behavior on combinations of Boolean …

In this paper, we investigate the properties of generalized bent functions defined on Z _2^ n
with values in Z _q, where q≥ 2 is any positive integer. We characterize the class of …

In this work, we employ the concept of composite representation of Boolean functions, which
represents an arbitrary Boolean function as a composition of one Boolean function and one …

In this paper, we consider the maximum absolute value Δ f in the autocorrelation spectrum
(not considering the zero point) of a function f. In an even number of variables n, bent …

The criterion for the global avalanche characteristics (GAC) of cryptographic functions is an
important property. To measure the correlation between two arbitrary Boolean functions, we …

The design of plateaued functions over GF (2) n, also known as 3-valued Walsh spectra
functions (taking the values from the set {0,±2 Γ (n+ s/2) 1}), has been commonly …

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 …

In this paper we start developing a detailed theory of nega–Hadamard transforms.
Consequently, we derive several results on negabentness of concatenations, and partially …