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

In this survey, we revisit the Rothaus paper and the chapter of Dillon's thesis dedicated to
bent functions, and we describe the main results obtained on these functions during these …

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 …

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 …

In a recent paper, it was shown that the restrictions of bent functions to subspaces of
codimension 1 and 2 are highly nonlinear. Here, we present an extensive study of the …

We study the Boolean functions [Formula: see text], of the form f (x)= Tr (λxd) with d= 22r+
2r+ 1 and [Formula: see text]. Our main result is the characterization of those λ for which fλ …

In this correspondence, we focus on bent functions of the form F (2/sup n/)/spl rarr/F (2)
where x/spl rarr/Tr (/spl alpha/x/sup d/). The main contribution of this correspondence is, that …

Boolean functions represent an important primitive in the design of various cryptographic
algorithms. There exist several well-known schemes where a Boolean function is used to …

This paper is devoted to the study of hyperbent functions in n variables, ie, bent functions
which are bent up to a change of primitive roots in the finite field GF (2 n). Our main purpose …

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 …