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.
Alberto Dennunzio; Enrico Formenti; Luca Manzoni; Antonio E. Porreca. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10248, pp.151-164, 2017, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-58631-1_12〉
https://hal.inria.fr/hal-01656352
Contributeur : Hal Ifip
<>
Soumis le : mardi 5 décembre 2017 - 15:42:09
Dernière modification le : jeudi 7 février 2019 - 16:31:45
Luca Mariot, Enrico Formenti, Alberto Leporati. Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata. Alberto Dennunzio; Enrico Formenti; Luca Manzoni; Antonio E. Porreca. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10248, pp.151-164, 2017, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-58631-1_12〉. 〈hal-01656352〉
