Enumeration of maximal cycles generated by orthogonal cellular automata
From MaRDI portal
Publication:6535752
DOI10.1007/S11047-022-09930-1zbMATH Open1547.68475MaRDI QIDQ6535752FDOQ6535752
Authors: Luca Mariot 
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
pseudorandom number generatorscellular automataLatin squarespolynomialsSylvester matricesmultipermutation
Orthogonal arrays, Latin squares, Room squares (05B15) Polynomials over finite fields (11T06) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)
Cites Work
- Combinatorial Designs
- Theory of cellular automata: a survey
- Endomorphisms and automorphisms of the shift dynamical system
- Title not available (Why is that?)
- Handbook of finite fields
- How to share a secret
- Title not available (Why is that?)
- Discriminants, resultants, and multidimensional determinants
- Title not available (Why is that?)
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Designing cryptographically strong S-boxes with use of 1D cellular automata
- On the need for multipermutations: Cryptanalysis of MD4 and SAFER
- A secret sharing scheme based on cellular automata
- Title not available (Why is that?)
- Cryptography
- Cellular automata based S-boxes
- Mutually orthogonal Latin squares based on cellular automata
- Cryptographic properties of bipermutive cellular automata rules
- Advances on Random Sequence Generation by Uniform Cellular Automata
- Contemporary abstract algebra.
- Partially permutive cellular automata
- Quasilinear cellular automata
- Invertible shift-invariant transformations on binary arrays
- Enumerating orthogonal Latin squares generated by bipermutive cellular automata
- Nonlinear diffusion layers
- Boolean Functions for Cryptography and Coding Theory
- A Walsh exploration of elementary CA rules
- Title not available (Why is that?)
- Inversion of Mutually Orthogonal Cellular Automata
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
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)
