Mutually orthogonal Latin squares based on cellular automata

DOI10.1007/s10623-019-00689-8zbMath1447.05040arXiv1906.08249OpenAlexW3098467670WikidataQ126861893 ScholiaQ126861893MaRDI QIDQ2291667

Luca Mariot, Alberto Leporati, Enrico Formenti, Maximilien Gadouleau

Publication date: 31 January 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.08249

zbMATH Keywords

orthogonal Latin squarescelluar automatalinear Latin square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80)

Related Items (7)

Exploring semi-bent Boolean functions arising from cellular automata ⋮ Mutually orthogonal Latin squares as group transversals ⋮ Diagonal cellular factor pair Latin squares ⋮ Bent functions in the partial spread class generated by linear recurring sequences ⋮ Local permutation polynomials and the action of e-Klenian groups ⋮ Heuristic search of (semi-)bent functions based on cellular automata ⋮ On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields
• Combinatorial characterizations of authentication codes
• Predicting nonlinear cellular automata quickly by decomposing them into linear ones
• Enumerating orthogonal Latin squares generated by bipermutive cellular automata
• Cellular automata based S-boxes
• Theory of cellular automata: a survey
• Concerning the number of mutually orthogonal latin squares
• Complexity of some arithmetic problems for binary polynomials
• On an involution concerning pairs of polynomials over \(\mathbb{F}_2\)
• Discriminants, resultants, and multidimensional determinants
• A secret sharing scheme based on cellular automata
• The Probability of Relatively Prime Polynomials
• Partially permutive cellular automata
• On the need for multipermutations: Cryptanalysis of MD4 and SAFER
• Endomorphisms and automorphisms of the shift dynamical system
• Rook domains, Latin squares, affine planes, and error-distributing codes
• A cryptographic and coding-theoretic perspective on the global rules of cellular automata
• Computing the periods of preimages in surjective cellular automata

This page was built for publication: Mutually orthogonal Latin squares based on cellular automata