Implementing a multiple recursive generator with mersenne prime modulus
From MaRDI portal
Recommendations
- The revised recursive reduction for efficiently generating random numbers
- Cunningham numbers in modular arithmetic
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- Optimal multipliers for linear congruential pseudorandom number generators with prime moduli
- Full period of a multiple recursive random number generator with generalized Mersenne prime number
Cites work
- A search for good multiple recursive random number generators
- Coding the Lehmer pseudo-random number generator
- Implementing a random number package with splitting facilities
- Some Experimental Observations on the Behavior of Composite Random Number Generators
- Symmetry property of multiplicative congruential random number generator in chi-square test
Cited in
(6)- Modified decomposition method for multiple recursive random number generator
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- Symmetry properties of multiple recursive random number generators in full period and spectral test
- Implementing 64-bit Maximally Equidistributed F 2 -Linear Generators with Mersenne Prime Period
- Computation of the least primitive root
- PMNS for cryptography: a guided tour
This page was built for publication: Implementing a multiple recursive generator with mersenne prime modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521207)
