Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony

DOI10.1007/978-3-319-99813-8_39zbMath1515.68195OpenAlexW2888524838MaRDI QIDQ6163611

Luca Mariot, Luca Manzoni

Publication date: 30 June 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99813-8_39

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

Exploring semi-bent Boolean functions arising from cellular automata, Heuristic search of (semi-)bent functions based on cellular automata

Cites Work

• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• The firing squad synchronization problem on CA with multiple updating cycles
• Computation in artificially evolved, non-uniform cellular automata
• Fully asynchronous behavior of double-quiescent elementary cellular automata
• Asynchronous cellular automata and dynamical properties
• 1-Resiliency of Bipermutive Cellular Automata Rules
• Advances on Random Sequence Generation by Uniform Cellular Automata
• Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
• Analysis of Pseudo Random Sequences Generated by Cellular Automata
• Asynchrony Immune Cellular Automata
• Stream Ciphers
• Computational Complexity
• A parallel implementation of a cellular automata based model for coffee percolation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item