A study of 128-bit multipliers for congruential pseudorandom number generators

Published: 1 January 2000| Version 1 | DOI: 10.17632/n7vhvbfssn.1
Iosif G. Dyadkin, Kenneth G. Hamilton


Abstract A study was conducted of multipliers for 128-bit congruential pseudorandom number generators. Extensive analysis and testing resulted in the identification of over 2000 good multipliers of the form A = 5^kmod 2^(128), where k is a prime number. The integer lattice structure from any single multiplier is so fine that it is not visible when REAL*8 values are returned in up to four dimensions, or REAL*4 values in seven dimensions. The multipliers are designed to be used in sets, and are suit... Title of program: RNMULT128 Catalogue Id: ADLK_v1_0 Nature of problem Any Monte Carlo calculation in physics or other subjects, particularly those involving massively parallel processing. Versions of this program held in the CPC repository in Mendeley Data ADLK_v1_0; RNMULT128; 10.1016/S0010-4655(99)00467-1 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method