During the last five decades, many different secondary constructions of bent functions were
proposed in the literature. Nevertheless, apart from a few works, the question about the class …

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 …

A Boolean function $ f $ on $ n $ variables is said to be a bent function if the absolute value
of all its Walsh coefficients is $2^{n/2} $. Our main result is a new asymptotic lower bound on …

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 …

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 …

Affine equivalence of Boolean functions has various applications in computer science and
modern cryptography, such as circuit design and S-boxes. Existing methods for detecting …

A Boolean function f on n variables is said to be a bent function if the absolute value of all its
Walsh coefficients is 2 n/2. Our main result is a new asymptotic lower bound on the number …

The problem of designing explicit bent and plateaued functions has been researched for
several decades. However, finding new bent functions outside the well-known completed …

A corrector is a critical component of True Random Number Generators (TRNGs), serving as
a post-processing function to reduce statistical weaknesses in raw random sequences. It is …

Plateaued (vectorial) functions over finite fields have diverse applications in symmetric
cryptography, coding theory, and sequence theory. Constructing these functions is an …