Beware of linear congruential generators with multipliers of the form a = ±2 q ±2 r
- 1 September 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 25 (3) , 367-374
- https://doi.org/10.1145/326147.326156
Abstract
Linear congruential random-number generators with Mersenne prime modulus and multipliers of the form a = ±2 q ± r have been proposed recently. Their main advantage is the availability of a simple and fast implementation algorithm for such multipliers. This note generalizes this algorithm, points out statistical weaknesses of these multipliers when used in a straightforward manner, and suggests in what context they could be used safely.Keywords
This publication has 5 references indexed in Scilit:
- Good Parameters and Implementations for Combined Multiple Recursive Random Number GeneratorsOperations Research, 1999
- Tables of linear congruential generators of different sizes and good lattice structureMathematics of Computation, 1999
- Multiplicative, congruential random-number generators with multiplier ± 2
k
1
± 2
k
2
and modulus 2
p
- 1ACM Transactions on Mathematical Software, 1997
- Combined Multiple Recursive Random Number GeneratorsOperations Research, 1996
- Monte CarloPublished by Springer Nature ,1996