Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata

(1, 2) , (2) , (1)
1
2

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.
Fichier principal
Vignette du fichier
447449_1_En_12_Chapter.pdf (293.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01656352 , version 1 (05-12-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
79 View
108 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More