Permutation and sampling with maximum length CA or pseudorandom number generation

DOI10.1016/J.AMC.2006.06.099zbMATH Open1120.65307OpenAlexW2003394459MaRDI QIDQ870167FDOQ870167

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

Recommendations

• Randomness quality of permuted pseudorandom binary sequences
• Random number generation using decimal cellular automata
• Maximum-length sequences, cellular automata, and random numbers
• Random sequence generation by cellular automata
• LAYERED CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION

zbMATH Keywords

cellular automatapseudorandom number generationrandomness testingdynamic samplingdata-dependent permutation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870167)