Abstract
A method, that generates 36-bit machine-independent sets of pseudo-random numbers uniformly distributed in the interval (0.0 to 1.0), is proposed. The method has been tested on several computers, including the PDP 11/10 (16 bit), VAX 11/780 (32 bit), CII 10070 (32 bit), and UNIVAC 1110 (36 bit). The pseudo-random sequences. Normal, Log-normal, Binomial, Poisson, and Chi-squared, are calculated from the Uniform distribution. These pseudo-random numbers give perfect reproducibility regardless of the operating system and/or kind of computer used. This is of the first importance in simulation methods, like the Monte Carlo method. The cycle of the pseudo-random sequence has been tested up to 10**7.
Recommendations
Bit-Wise Behavior of Random Number Generators
In 1985, G. Marsaglia proposed the m-tuple test, a runs test on bits, as a test of nonrandomness of a sequence of pseudorandom integers. We try this test on the outputs from a large set of pseudorandom number generators and discuss the behavior of the ...
Occupancy Numbers in Testing Random Number Generators
The classical occupancy problem where n balls are placed in N cells is used for testing of random number generators. We show that the statistics of appropriately chosen occupancy numbers are incompatible with the statistics of manypseudorandom number ...
Random Numbers for Quantum Key Distribution
SYNASC '08: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific ComputingQuantum Key Distribution (QKD) has seen an important development for the last ten years. Nowadays, different companies offer commercial solutions and key exchanges at pulse rates of up to 1 GHz and over distances of up to 00km have been demonstrated in ...





Comments