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

We give a new lower bound to the covering radius of the first order Reed–Muller code RM
(1, n), where n∈{9, 11, 13}. Equivalently, we present the n-variable Boolean functions for …

We study more in detail the relationship between rotation symmetric (RS) functions and
idempotents, in univariate and bivariate representations, and deduce a construction of bent …

Constructing S-boxes that are inherently resistant against side-channel attacks is an
important problem in cryptography. By using an optimal distinguisher under an additive …

The rth order nonlinearity of a Boolean function is an important cryptographic criterion in
analyzing the security of stream as well as block ciphers. It is also important in coding theory …

Rotation symmetric bent functions and their generation two-rotation symmetric bent functions
are two classes of cryptographically significant Boolean functions. However, few …

This paper considers the construction of resilient Boolean functions on an odd number of
variables with strictly almost optimal (SAO) nonlinearity. Through introducing the …

The r th-order nonlinearity, where r≥ 1, of an n-variable Boolean function f, denoted by nl r
(f), is defined as the minimum Hamming distance of f from all n-variable Boolean functions of …

A Boolean function in n variables is rotation symmetric (RS) if it is invariant under powers of
ρ (x 1,…, xn)=(x 2,…, xn, x 1). An RS function is called monomial rotation symmetric (MRS) if …

In this paper, we first present two systematic constructions of bent functions by modifying the
truth tables of Rothaus's bent function and Maiorana-McFarland's bent function respectively …