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 …

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 …

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 …

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 …

We consider the problem of enumerating pairs of bipermutive cellular automata (CA) which
generate orthogonal Latin squares. Since the problem has already been settled for …

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

We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated
by the fact that such CA always define bijective vectorial Boolean functions, and could thus …

We consider the problem of exhaustively visiting all pairs of linear cellular automata which
give rise to orthogonal Latin squares, ie, linear Orthogonal Cellular Automata (OCA). The …

Most of the approaches published in the literature to construct S-boxes via Cellular
Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot …

Two Latin squares of order n are r-orthogonal if, when superimposed, there are exactly r
distinct ordered pairs. The spectrum of all values of r for Latin squares of order n is known. A …