32-bit multipliers for linear congruential random number generators
From MaRDI portal
Publication:5307742
DOI10.1080/09720529.2006.10698090zbMath1344.65010OpenAlexW2327702936MaRDI QIDQ5307742
Publication date: 18 September 2007
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2006.10698090
Cryptography (94A60) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Symmetry properties of multiple recursive random number generators in full period and spectral test
- Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
- Reverse multiple recursive random number generators
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- Unnamed Item
This page was built for publication: 32-bit multipliers for linear congruential random number generators