IBM Systems Journal · 1969 · 373 citations · 17 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureCryptographyRandom Number GenerationRegister AllocationHardware Random Number GeneratorsPseudo-random Number GenerationPseudo-random Number GeneratorsPseudorandom GeneratorsRandom Number Generator TestingRegisters
The purpose of this paper is to describe a pseudo-random number generator that uses the full capacity of the 32-bit registers of IBM SYSTEM/360 computers, and to briefly report on and document the testing of and experience with the random number generator. The generator is a particular case of the sequence of numbers x <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf> generated by the equation x <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i+1</inf> = Ax <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf> (mod p) (1) where p is a prime and A is a positive primitive root of p.
17
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
Uniform Random Number Generators
M. Donald MacLaren, George Marsaglia · Journal of the ACM · 1965 · 242 citations · Full text