Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata

Abstract : 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 bipermutive CA with linear local rules, we address the general case of nonlinear rules, which could be interesting for cryptographic applications such as the design of cheater-immune secret sharing schemes. We first prove that two bipermutive CA generating orthogonal Latin squares must have pairwise balanced local rules. Then, we count the number of pairwise balanced bipermutive Boolean functions and enumerate those which generate orthogonal Latin squares up to $n=6$ variables, classifying them with respect to their nonlinearity values.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

Contributor : Hal Ifip <>
Submitted on : Tuesday, December 5, 2017 - 3:42:09 PM
Last modification on : Thursday, February 7, 2019 - 4:31:45 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2020-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Luca Mariot, Enrico Formenti, Alberto Leporati. Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.151-164, ⟨10.1007/978-3-319-58631-1_12⟩. ⟨hal-01656352⟩



Record views