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 …

We introduce a new approach to proving that a sequence of deterministic linear codes
achieves capacity on an erasure channel under maximum a posteriori decoding. Rather …

After the improvement by Courtois and Meier of the algebraic attacks on stream ciphers and
the introduction of the related notion of algebraic immunity, several constructions of infinite …

There are procedures to encrypt images; however, sometimes there is a loss of information
in the decryption process or the key set size is not specifically mentioned. In this research …

The cryptanalytic resistance of modern block and stream encryption systems mainly
depends on the substitution box (S-box). In this context, the problem is thus to create an S …

The nonlinearity profile of a Boolean function (ie, the sequence of its minimum Hamming
distances nl r (f) to all functions of degrees at most r, for r ges 1) is a cryptographic criterion …

Inspired by the previous work of Tu and Deng, we propose two infinite classes of Boolean
functions of 2 k variables where k≥ 2. The first class contains unbalanced functions having …

Based on a method proposed by the first author, several classes of balanced Boolean
functions with optimum algebraic immunity are constructed, and they have nonlinearities …

In this paper, we propose a new method for drawing a cryptographically strong substitution
box using the Lorenz system and quantum genetic algorithm techniques. We used the …