Enumeration of maximal cycles generated by orthogonal cellular automata
type: Item
instance of: scholarly article
title: Enumeration of maximal cycles generated by orthogonal cellular automata
zbMATH Open document ID: 1547.68475
author: Luca Mariot
published in: Natural Computing
publication date: 2024-02-09T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 37B15
zbMATH DE Number: 7802725
zbMATH Keywords: cellular automata
zbMATH Keywords: Latin squares
zbMATH Keywords: pseudorandom number generators
zbMATH Keywords: multipermutation
zbMATH Keywords: Sylvester matrices
zbMATH Keywords: polynomials
MaRDI profile type: MaRDI publication profile
cites work: Q3635536
cites work: Boolean Functions for Cryptography and Coding Theory
cites work: Invertible shift-invariant transformations on binary arrays
cites work: A secret sharing scheme based on cellular automata
cites work: Partially permutive cellular automata
cites work: Advances on Random Sequence Generation by Uniform Cellular Automata
cites work: Contemporary abstract algebra.
cites work: Discriminants, resultants, and multidimensional determinants
cites work: Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Secret Sharing Schemes for (k, n)-Consecutive Access Structures
cites work: Q3222326
cites work: Theory of cellular automata: a survey
cites work: Q2942174
cites work: Q4449875
cites work: Cryptographic properties of bipermutive cellular automata rules
cites work: Q5690468
cites work: Nonlinear diffusion layers
cites work: Inversion of Mutually Orthogonal Cellular Automata
cites work: Enumerating orthogonal Latin squares generated by bipermutive cellular automata
cites work: Mutually orthogonal Latin squares based on cellular automata
cites work: Cellular automata based S-boxes
cites work: Q3511731
cites work: Analysis of Pseudo Random Sequences Generated by Cellular Automata
cites work: Quasilinear cellular automata
cites work: Handbook of finite fields
cites work: How to share a secret
cites work: Combinatorial Designs
cites work: Cryptography
cites work: Q2998126
cites work: On the need for multipermutations: Cryptanalysis of MD4 and SAFER
DOI: 10.1007/S11047-022-09930-1
description: scientific article; zbMATH DE number 7802725