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

@article{Mariot2021HipTB, title={Hip to Be (Latin) Square: Maximal Period Sequences from Orthogonal Cellular Automata}, author={L. Mariot}, journal={ArXiv}, year={2021}, volume={abs/2106.07750} }

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 secret sharing schemes. In this paper, we consider OCA for a different cryptographic task, namely the generation of pseudorandom sequences. The idea is to iterate a dynamical system where the output of an OCA pair is fed back as a new set of coordinates on the superposed squares. The main advantage is that OCA ensure… Expand

#### References

SHOWING 1-10 OF 31 REFERENCES

Inversion of Mutually Orthogonal Cellular Automata

- Computer Science
- ACRI
- 2018

This work designs an algorithm based on coupled de Bruijn graphs which solves the inversion problem of pairs of configurations in MOCA, and shows how to design a (2, n) threshold Secret Sharing Scheme (SSS) based on MocA where any combination of two players can reconstruct the secret by applying this inversion algorithm. Expand

Constructing Orthogonal Latin Squares from Linear Cellular Automata

- Computer Science, Mathematics
- ArXiv
- 2016

This work shows how to generate Latin squares through bipermutive CA and proves that two linear CA induce a pair of orthogonal Latin squares if and only if the polynomials associated to their local rules are relatively prime. Expand

Mutually orthogonal latin squares based on cellular automata

- Computer Science, Mathematics
- Des. Codes Cryptogr.
- 2020

It is proved that the Latin squares induced by two Linear Bipermutive CA (LBCA) over the finite field F q are orthogonal if and only if the polynomials associated to their local rules are relatively prime. Expand

Cellular automata based S-boxes

- Computer Science
- Cryptography and Communications
- 2018

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. Expand

Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata

- Mathematics, Computer Science
- GECCO
- 2017

The evolutionary approach is adopted to address the nonlinear case of Orthogonal Latin Squares, and it is shown that GP is always able to generate OLS, even if the optimal solutions found with the first fitness function are mostly linear. Expand

Inversion of cellular automata iterations

- Mathematics
- 1997

An algorithm for inverting an iteration of the one-dimensional cellular automaton is presented. The algorithm is based on the linear approximation of the updating function, and requires less than… Expand

Advances on Random Sequence Generation by Uniform Cellular Automata

- Computer Science, Mathematics
- Computing with New Resources
- 2014

It is proposed here to use some recent research in the classification of Boolean functions and to link it with the study of cellular automata rules, which provides a mean to get Boolean functions with good cryptographic properties. Expand

Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata

- Computer Science
- AUTOMATA
- 2017

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. Expand

Cryptographic Properties of Bipermutive Cellular Automata Rules

- Computer Science, Mathematics
- J. Cell. Autom.
- 2014

This paper carries out an exhaustive exploration of the 256 bipermutive rules of radius 2, in order to select those rules satisfying additional cryptographic criteria (2-resiliency and high nonlinearity), and test them through the ENT and NIST statistical test suites. Expand

Analysis of Pseudo Random Sequence Generated by Cellular Automata

- Computer Science
- EUROCRYPT
- 1991

It is shown that key search can be reduced considerably if one is contented to succeed only with a certain success probability, established by an information theoretic analysis of arbitrary key saurces with non-uniform probability distribution. Expand