This chapter provides a general overview of AI methods used to support the design of
cryptographic primitives and protocols. After giving a brief introduction to the basic concepts …

An interesting thread in the research of Boolean functions for cryptography and coding
theory is the study of secondary constructions: given a known function with a good …

Bipermutive rules are known to induce both expansive and mixing chaotic cellular automata.
In this paper, we study some cryptographic properties of bipermutive rules, initially proving …

The study of cellular automata rules suitable for cryptographic applications is under
consideration. On one hand, cellular automata can be used to generate pseudo-random …

Cellular Automata (CA) have been extensively used to implement symmetric cryptographic
primitives, such as pseudorandom number generators and S-boxes. However, most of the …

Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a
new approach to construct orthogonal Latin squares for cryptographic applications such as …

Cellular Automata (CA) have widely been studied to design cryptographic primitives such as
stream ciphers and pseudorandom number generators, focusing in particular on the …

It is known that CA rules which are both leftmost and rightmost permutive (bipermutive rules)
are expansively and mixing chaotic. In this paper, we prove that bipermutive rules also …

Cellular Automata (CA) have a long history being employed as pseudo-random number
generators (PRNG), especially for cryptographic applications such as keystream generation …

Cellular automata (CA) are an interesting computational model for designing pseudorandom
number generators (PRNG), due to the complex dynamical behavior they can exhibit …