Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from
simple local interaction and computation. Since the inception of cellular automaton (CA) by …

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 …

We investigate the design of Orthogonal Latin Squares (OLS) by means of Genetic
Algorithms (GA) and Genetic Programming (GP). Since we focus on Latin squares …

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

This article surveys some theoretical aspects of Cellular Automata (CAs) research. In
particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all 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 …

The one-dimensional cellular automata (CA) system detailed herein uses a hybrid
mechanism to attain reversibility, and this approach is adapted to create a novel block cipher …

Due to their significant correlation and redundancy, conventional block cipher cryptosystems
are not efficient in encrypting multimedia data. Stream ciphers based on Cellular Automata …

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