On the generation of high-quality random numbers by two-dimensional cellular automata
From MaRDI portal
Publication:3417053
DOI10.1109/12.888056zbMath1315.68187OpenAlexW2121719389WikidataQ56092391 ScholiaQ56092391MaRDI QIDQ3417053
Marco Tomassini, Mathieu Perrenoud, Moshe Sipper
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.888056
Cellular automata (computational aspects) (68Q80) Random number generation in numerical analysis (65C10)
Related Items (11)
Image security system using recursive cellular automata substitution ⋮ Permutation and sampling with maximum length CA or pseudorandom number generation ⋮ A search for good pseudo-random number generators: survey and empirical studies ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Study of Five-Neighborhood Linear Hybrid Cellular Automata and Their Synthesis ⋮ An Efficient n ×n Boolean Mapping Using Additive Cellular Automata ⋮ Improving the pseudo-randomness properties of chaotic maps using deep-zoom ⋮ Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata ⋮ Randomness quality of permuted pseudorandom binary sequences ⋮ Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration ⋮ Compatibility between agents as a tool for coarse-grained descriptions of quantum systems
This page was built for publication: On the generation of high-quality random numbers by two-dimensional cellular automata
