Randomness quality of permuted pseudorandom binary sequences
From MaRDI portal
Publication:1005204
DOI10.1016/j.matcom.2008.07.012zbMath1159.65303OpenAlexW2087139275MaRDI QIDQ1005204
Publication date: 9 March 2009
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2008.07.012
numerical examplescellular automatapseudorandom number generationDIEHARD testinglinear finite state machine
Cites Work
- 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
- Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers
- CONFIGURABLE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION
- OPTIMIZATION OF 2D LATTICE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION
This page was built for publication: Randomness quality of permuted pseudorandom binary sequences