Advances on Random Sequence Generation by Uniform Cellular Automata

DOI10.1007/978-3-319-13350-8_5zbMath1323.68392OpenAlexW184356974MaRDI QIDQ2944879

Jean-Baptiste Yunès, Katsunobu Imai, Enrico Formenti, Bruno Martin

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

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

zbMATH Keywords

cellular automataBoolean functionsrandom number generation

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Automata sequences (11B85)

Related Items (11)

Exploring semi-bent Boolean functions arising from cellular automata ⋮ Investigating four neighbourhood cellular automata as better cryptographic primitives ⋮ Resilient Vectorial Functions and Cyclic Codes Arising from Cellular Automata ⋮ Asynchrony Immune Cellular Automata ⋮ A cryptographic and coding-theoretic perspective on the global rules of cellular automata ⋮ Heuristic search of (semi-)bent functions based on cellular automata ⋮ Search space reduction of asynchrony immune cellular automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony ⋮ Achieving Better Security Using Nonlinear Cellular Automata as a Cryptographic Primitive ⋮ Unnamed Item

Cites Work

• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
• A spectral characterization of correlation-immune combining functions
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Advances on Random Sequence Generation by Uniform Cellular Automata