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
- 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?)
- A Walsh exploration of elementary CA rules
- A secret sharing scheme based on cellular automata
- Advances on random sequence generation by uniform cellular automata
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Boolean functions for cryptography and coding theory
- Cellular automata based S-boxes
- Combinatorial Designs
- Contemporary abstract algebra.
- Cryptographic properties of bipermutive cellular automata rules
- Cryptography. Theory and practice
- Designing cryptographically strong S-boxes with use of 1D cellular automata
- Discriminants, resultants, and multidimensional determinants
- Endomorphisms and automorphisms of the shift dynamical system
- Enumerating orthogonal Latin squares generated by bipermutive cellular automata
- Handbook of finite fields
- How to share a secret
- Inversion of Mutually Orthogonal Cellular Automata
- Invertible shift-invariant transformations on binary arrays
- Mutually orthogonal Latin squares based on cellular automata
- Nonlinear diffusion layers
- On the need for multipermutations: Cryptanalysis of MD4 and SAFER
- Partially permutive cellular automata
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Quasilinear cellular automata
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- Theory of cellular automata: a survey
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)
