Premium
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
Author(s) -
Steele Guy L.,
Vigna Sebastiano
Publication year - 2022
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.3030
Subject(s) - pseudorandom number generator , pseudorandom generator theorem , random number generation , mathematics , square root , dimension (graph theory) , pseudorandomness , product (mathematics) , linear congruential generator , arithmetic , lattice (music) , number theory , discrete mathematics , algorithm , power (physics) , combinatorics , physics , geometry , quantum mechanics , acoustics
Congruential pseudorandom number generators rely on good multipliers , that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag eight for generators with typical power‐of‐two moduli, analyzing in detail multipliers close to the square root of the modulus, whose product can be computed quickly.