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 …

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 …

Bent functions are optimal combinatorial objects. Since their introduction, substantial efforts
have been directed toward their study in the last three decades. A complete classification of …

Several New Classes of Bent Functions From Dillon Exponents Page 1 1818 IEEE
TRANSACTIONS ON INFORMATION THEORY, VOL. 59, NO. 3, MARCH 2013 Several New …

As a class of optimal combinatorial objects, bent functions have important applications in
cryptography, sequence design, and coding theory. Bent idempotents are a subclass of bent …

This article is devoted to Boolean and vectorial bent functions and their duals. Our ultimate
objective is to increase such functions' corpus by designing new ones covering many …

In this paper, a generic construction of codebooks based on binary codes is introduced. With
this generic construction, a few previous constructions of optimal codebooks are extended …

A Boolean function with an even number of variables is called bent if it is maximally
nonlinear. This paper extends the recent work of the author on bent functions (“Several new …

Kloosterman sums have recently become the focus of much research, most notably due to
their applications in cryptography and coding theory. In this paper, we extensively …