Permutation and sampling with maximum length CA or pseudorandom number generation

DOI10.1016/j.amc.2006.06.099zbMath1120.65307OpenAlexW2003394459MaRDI QIDQ870167

Sastra Wijaya, Sheng-Uei Guan, Syn Kiat Tan

Publication date: 12 March 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.099

zbMATH Keywords

cellular automatapseudorandom number generationrandomness testingdynamic samplingdata-dependent permutation

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Random number generation in numerical analysis (65C10)

Related Items (2)

Hyperchaotic encryption based on multi-scroll piecewise linear systems ⋮ On the properties of reachability, observability, controllability, and constructibility of discrete-time positive time-invariant linear systems with aperiodic choice of the sampling instants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Good random number generators are (not so) easy to find
• A secret sharing scheme based on cellular automata
• On the generation of high-quality random numbers by two-dimensional cellular automata
• Communication Theory of Secrecy Systems*
• Parallel Processing and Applied Mathematics

This page was built for publication: Permutation and sampling with maximum length CA or pseudorandom number generation