Enumeration of maximal cycles generated by orthogonal cellular automata
From MaRDI portal
Publication:6535752
DOI10.1007/S11047-022-09930-1zbMATH Open1547.68475MaRDI QIDQ6535752
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Latin squarescellular automatapolynomialspseudorandom number generatorsSylvester matricesmultipermutation
Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80) Polynomials over finite fields (11T06) Dynamical aspects of cellular automata (37B15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Quasilinear cellular automata
- Invertible shift-invariant transformations on binary arrays
- Enumerating orthogonal Latin squares generated by bipermutive cellular automata
- Cellular automata based S-boxes
- Theory of cellular automata: a survey
- Nonlinear diffusion layers
- Mutually orthogonal Latin squares based on cellular automata
- Discriminants, resultants, and multidimensional determinants
- A secret sharing scheme based on cellular automata
- Contemporary abstract algebra.
- Cryptographic properties of bipermutive cellular automata rules
- Handbook of finite fields
- Advances on Random Sequence Generation by Uniform Cellular Automata
- How to share a secret
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Partially permutive cellular automata
- Combinatorial Designs
- On the need for multipermutations: Cryptanalysis of MD4 and SAFER
- Boolean Functions for Cryptography and Coding Theory
- Endomorphisms and automorphisms of the shift dynamical system
- Cryptography
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- Inversion of Mutually Orthogonal Cellular Automata
This page was built for publication: Enumeration of maximal cycles generated by orthogonal cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535752)
