Polynomial pseudo-random number generator via cyclic phase
From MaRDI portal
Publication:2271601
DOI10.1016/j.matcom.2009.05.006zbMath1169.65301MaRDI QIDQ2271601
Publication date: 7 August 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.2009.05.006
numerical examples; Monte Carlo simulation; random number; pseudo-random number generator shift register
65C10: Random number generation in numerical analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Good random number generators are (not so) easy to find
- Local Randomness in Polynomial Random Number and Random Function Generators
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- On Optimal GFSR Pseudorandom Number Generators
- Arithmetic in a Finite Field
- Characteristic m-Sequences
- On Pseudo-Random Arrays
- Mersenne twister
- The k-Dimensional Distribution of Combined GFSR Sequences
- On the Use of Reducible Polynomials as Random Number Generators
- Primitive Binary Polynomials
- Twisted GFSR generators II
- Random Numbers Generated by Linear Recurrence Modulo Two
- Galois theory