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 …

The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash
functions has been repeatedly expressed by professionals, notably to implement …

Recently, algebraic attacks have received a lot of attention in the cryptographic literature. It
has been observed that a Boolean function f used as a cryptographic primitive, and …

The need for lightweight cryptographic hash functions has been repeatedly expressed by
application designers, notably for implementing RFID protocols. However not many designs …

In this paper we investigate the relationship between the nonlinearity and the order of
resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for …

Rotation symmetric (RotS) Boolean functions have been used as components of different
cryptosystems. This class of Boolean functions are invariant under circular translation of …

The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …

In this paper, we analyze the algebraic immunity of symmetric Boolean functions. The
algebraic immunity is a property which measures the resistance against the algebraic …

Recently algebraic attack has received a lot of attention in cryptographic literature. It has
been observed that a Boolean function f, interpreted as a multivariate polynomial over GF …

It is proved that the maximal possible nonlinearity of nvariable m-resilient Boolean function
is 2 n-1-2 m+ 1 for 2 n-7/3≤ m≤ n-2. This value can be achieved only for optimized …