Permutation and sampling with maximum length CA or pseudorandom number generation
From MaRDI portal
Publication:870167
Recommendations
Cites work
- scientific article; zbMATH DE number 3986649 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1070886 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- A secret sharing scheme based on cellular automata
- Communication Theory of Secrecy Systems*
- 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
(3)- Randomness quality of permuted pseudorandom binary sequences
- 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)