Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
نویسندگان
چکیده
Congruential pseudorandom number generators rely on good multipliers, that is, integers have performance with respect to the spectral test. We provide lists of multipliers a lattice structure up dimension eight and lag for typical power-of-two moduli, analyzing in detail close square root modulus, whose product can be computed quickly.
منابع مشابه
On a nonlinear congruential pseudorandom number generator
A nonlinear congruential pseudorandom number generator with modulus M = 2w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.
متن کاملEmpirical Pseudorandom Number Generators
The most common pseudorandom number generator or PRNG, the linear congruential generator or LCG, belongs to a whole class of rational congruential generators. These generators work by multiplicative congruential method for integers, which implements a ”grow-and-cut procedure”. We extend this concept to real numbers and call this the real congruence, which produces another class of random number...
متن کاملA Method of Systematic Search for Optimal Multipliers in Congruential Random Number Generators
This paper presents a method of systematic search for optimal multipliers for congruential random number generators. The word-size of computers is a limiting factor for development of random numbers. The generators for computers up to 32 bit wordsize are already investigated in detail by several authors. Some partial works are also carried out for moduli of 2 and higher sizes. Rapid advances in...
متن کاملOn the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and MonteCarlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudor...
متن کاملExponential sums of nonlinear congruential pseudorandom number generators with Rédei functions
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. We give new bounds of exponential sums with sequences of iterations of Rédei functions over prime finite fields, which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators. © 2007 Elsevier Inc. All rights ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software - Practice and Experience
سال: 2021
ISSN: ['0038-0644', '1097-024X']
DOI: https://doi.org/10.1002/spe.3030