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

Exponential sums of symmetric Boolean functions are linear recurrent with integer
coefficients. This was first established by Cai, Green and Thierauf in the mid nineties …

Let fn (x 1, x 2,⋯, xn) denote the algebraic normal form (polynomial form) of a rotation
symmetric Boolean function of degree d in n≥ d variables and let wt (fn) denote the …

In this paper we consider perturbations of symmetric Boolean functions n, k_1+ n, k_s σ n, k
1+…+ σ n, ks in n-variable and degree ks. We compute the asymptotic behavior of Boolean …

Rotation symmetric Boolean functions are invariant under circular translation of indices.
These functions have very rich cryptographic properties and have been used in different …

Rotation symmetric (RS) Boolean functions have been extensively studied in recent years
because of their applications in cryptography. In cryptographic applications, it is usually …

This paper studies degree 3 Boolean functions in n variables which are rotation symmetric,
that is, invariant under any cyclic shift of the indices of the variables. These rotation …

A Boolean function in nn variables is 2 2-rotation symmetric if it is invariant under even
powers of the cyclic permutation ρ (x_1, ..., x_n)=(x_2, ..., x_n, x_1) ρ (x 1,…, xn)=(x 2,…, xn …

The goal of this paper is two-fold. We first focus on the problem of deciding whether two
monomial rotation symmetric (MRS) Boolean functions are affine equivalent via a …

This paper studies degree 3 Boolean functions in n variables x 1,..., xn which are rotation
symmetric, that is, invariant under any cyclic shift of the indices of the variables. These …