The multiple prime random number generator

Authors:
Alexander Haas
Affiliations:
Mercury Consolidated, Inc., 6999 Moores Mill Road, Huntsville, AL
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1987

Citing 5
Cited 2

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators

Journal of the ACM (JACM)
Generalized Feedback Shift Register Pseudorandom Number Algorithm

Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence

Journal of the ACM (JACM)
A comparison of the correlational behavior of random number generators for the IBM 360

Communications of the ACM

Random numbers for simulation

Communications of the ACM - Special issue on simulation
Technical correspondence

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

A new pseudorandom number generator, the Multiple Prime Random Number Generator, has been developed; it is efficient, conceptually simple, flexible, and easy to program. The generator utilizes cycles around prime numbers to guarantee the length of the period, which can easily be programmed to surpass the maximum period of any other presently available random number generator. There are minimum limits placed on the seed values of the variables because the period of the generator is not a function of the initial values of the variables. The generator passes thirteen standard random number generator tests. It requires only about fifteen lines of FORTRAN code to program and utilizes programming language constructs found in most major languages. Finally, it compares very favorably to the fastest of the other available generators.