Mutually orthogonal latin squares based on cellular automata

  title={Mutually orthogonal latin squares based on cellular automata},
  author={Luca Mariot and Maximilien Gadouleau and Enrico Formenti and Alberto Leporati},
  journal={Designs, Codes and Cryptography},
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 rule of diameter d over an alphabet of q elements generates a Latin square of order $$q^{d-1}$$ q d - 1 , we study the conditions under which two CA generate a pair of orthogonal Latin squares. In particular, we prove that the Latin squares induced by two Linear Bipermutive CA (LBCA) over the finite field $$\mathbb {F… 

Hip to Be (Latin) Square: Maximal Period Sequences from Orthogonal Cellular Automata

  • L. Mariot
  • Mathematics, Computer Science
    2021 Ninth International Symposium on Computing and Networking (CANDAR)
  • 2021
An algorithm based on Lagrange's theorem is devised to efficiently enumerate all linear OCA pairs that induce Sylvester matrices of maximal order up to diameter $d=11$, and characterize an upper bound on the periods of the sequences in terms of the order of the subgroup generated by an invertible Sylveste matrix.

Bent Functions from Cellular Automata

This work presents a primary construction of bent functions based on cellular automata (CA) and proves that the functions generated by the construction belong to the partial spread class PS−, a particular case of the Desarguesian spread construction.

Latin Hypercubes and Cellular Automata

It is proved that linear bipermutive CA (LBCA) yielding Latin hypercubes of dimension $k>2$ are defined by sequences of invertible Toeplitz matrices with partially overlapping coefficients, which can be described by a specific kind of regular de Bruijn graph induced by the support of the determinant function.

Enumeration of Maximal Cycles Generated by Orthogonal Cellular Automata

  • L. Mariot
  • Computer Science, Mathematics
    Natural Computing
  • 2022
This paper considers an alternative approach to generate pseudorandom sequences through orthogonal CA (OCA), which guarantees a better amount of diffusion.

An Enumeration Algorithm for Binary Coprime Polynomials with Nonzero Constant Term

This work addresses the enumeration of coprime polynomial pairs over F 2 where both polynomials have a nonzero constant term, motivated by the construction of orthogonal Latin squares via cellular automata and devise a combinatorial algorithm to enumerate all suchCoprime pairs of a given degree.

On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata

An exhaustive search of all nonlinear OCA pairs of diameter d = 4 and d = 5, which generate S-boxes of size 6 × 6 and 8 × 8 turns out to be linear, and thus they are not useful for the design of confusion layers in block ciphers.

Exploring Semi-bent Boolean Functions Arising from Cellular Automata

A combinatorial algorithm is devised to enumerate all quadratic Boolean functions through a construction based on cellular automata, and it is remarked that the semi-bent functions generated through the authors' construction by the remaining rules have a constant number of linear structures.

Heuristic search of (semi-)bent functions based on cellular automata

This work continues the investigation of a secondary construction based on cellular automata (CA), focusing on the classes of bent and semi-bent functions, and proves that the construction preserves the algebraic degree of the local rule.

Building Correlation Immune Functions from Sets of Mutually Orthogonal Cellular Automata

This paper shows that the orthogonal array associated to a family of MOCA can be expanded to a binary OA of strength at least 2 and observes that their correlation immunity order is actually greater, always at least 3.

Bent functions in the partial spread class generated by linear recurring sequences

Many of these functions defined by polynomials of degree d=2 are not EA-equivalent to any Maiorana–McFarland or Desarguesian partial spread function.



Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata

The general case of nonlinear rules in bipermutive cellular automata, which could be interesting for cryptographic applications such as the design of cheater-immune secret sharing schemes, is addressed.

Complexity of some arithmetic problems for binary polynomials

An exponential lower bound on the size of a decision tree for this function is obtained, and an asymptotic formula is derived, having a linear main term, for its average sensitivity is derived.

Computing the periods of preimages in surjective cellular automata

An equivalence is shown between preimages of LBCA and concatenated linear recurring sequences (LRS) that allows for a complete characterization of their periods and this paper considers the case of linear and bipermutive cellular automata defined over a finite field as state alphabet.

Cellular automata based S-boxes

A systematic investigation of the cryptographic properties of S-boxes defined by CA, proving some upper bounds on their nonlinearity and differential uniformity and proposing a “reverse engineering” method based on De Bruijn graphs to determine whether a specific S-box is expressible through a single CA rule.

A cryptographic and coding-theoretic perspective on the global rules of cellular automata

It is shown that linear CA are equivalent to linear cyclic codes, and a formula is derived from which the Walsh spectrum of CA induced by permutive local rules is derived, from which a formula for the nonlinearity of such CA is derived.

Rook domains, Latin squares, affine planes, and error-distributing codes

It is shown how various concepts in the theory of Latin squares are best expressed in the form of questions about the placing of rooks on k -dimensional hyperchessboards of side n, and that the optimal colorings in certain cases correspond to duals of desarguian projective planes.

Partially permutive cellular automata

A comprehensive scheme emerges that unifies the analysis of topological defects in cellular automata that can generate random walks as well as their degenerate forms.

Algebraic Properties of the Block Transformation on Cellular Automata

If the blocked rule satisfies an identity which holds for a broad class of algebras, then the underlying rule must have essentially the same structure, and must depend only on its leftmost and rightmost inputs; roughly speaking, that the block transformation cannot turn a nonlinear rule into a linear one.

Endomorphisms and automorphisms of the shift dynamical system

It is shown that closed subset of X(SQ which is invariant under a defines a subdynamical system, and that these mappings, composed with powers of the shift, constitute the entire class of continuous transformations which commute with the shift.