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 …

We investigate sets of mutually orthogonal latin squares (MOLS) generated by cellular
automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local …

Higher-order cellular automata (HOCA) are a variant of cellular automata (CA) used in many
applications (ranging, for instance, from the design of secret sharing schemes to data …

We present a construction of partial spread bent functions using subspaces generated by
linear recurring sequences (LRS). We first show that the kernels of the linear map**s …

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

In this work, we present a primary construction of bent functions based on cellular automata
(CA). We consider the well-known characterization of bent functions in terms of Hadamard …

Abstract Mutually Orthogonal Cellular Automata (MOCA) are sets of bipermutive CA which
can be used to construct pairwise orthogonal Latin squares. In this work, we consider the …

Motivated by applications to noncoherent network coding, we study subspace codes defined
by sets of linear cellular automata (CA). As a first remark, we show that a family of linear CA …

Latin squares and hypercubes are combinatorial designs with several applications in
statistics, cryptography and coding theory. In this paper, we generalize a construction of …

In this dissertation, we study two of the global properties of 1-dimensional cellular automata
(CAs) under periodic boundary condition, namely, reversibility and randomness. To address …