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 …

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

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 …

Many papers deal with the problem of constructing an efficient masking scheme for existing
block ciphers. We take the reverse approach: that is, given a proven masking scheme …

We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give
a simple characterization of bent functions. We extend it into a characterization of plateaued …

When does G(x)+γTr(H(x)) permute Fpn? Page 1 Finite Fields and Their Applications 15 (2009)
615–632 Contents lists available at ScienceDirect Finite Fields and Their Applications www.elsevier.com/locate/ffa …

Dobbertin (Construction of bent functions and balanced Boolean functions with high
nonlinearity, in: Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1008 …

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 …

A practical problem in symmetric cryptography is finding constructions of Boolean functions
leading to reasonably large sets of functions satisfying some desired cryptographic criteria …

Boolean functions are an important area of study for cryptography. These functions,
consisting merely of one's and zero's, are the heart of numerous cryptographic systems and …