Abstract
Several empirical tests were made of the apparent randomness of numbers generated by the additive process Xj = (Xj-1 + Xj-n) mod 1, where the X's are positive fractions. The results show that the numbers are uniformly distributed on the unit interval and that there is no significant serial correlation in the sequence. However, for n < 16, a test of run lengths indicates nonrandomness. This difficulty can be overcome by discarding alternate numbers.
- 1 H. J. A DUPARC, C G. LEKKERKERKER AND W PEREM.A.NS, Reduced sequeuces of in- tegers and pseudo-~andom numbers, Math Centrum, Amsterdam, Report ZW1953-002.Google Scholar
- 2 M.GREENBERGER, Chap III in G H. Orcutt, M Greenberger and A. M. Rivhm, Decision- Unit Models and Simulation of the Unzted States Economy, (Preliminary draft, 1958)Google Scholar
- 3 M G KENDALL, The Advanced Theory of Statistics, Vol II, London Griffin & Co., 1948Google Scholar
- 4 A M MOOD, The distribution theory of runs, Ann. Math Stat I1 (1940), 367-392Google Scholar
- 5 A M. MOOD, Introduction to the Theory of Statistics, New York McGraw-Hill, 1950Google Scholar
- 6 RAND CORPORATION, A Millon Random Digits, Glencoe, Ill The Free Press, 1955.Google Scholar
- 7 OLGA TAUSSKY AND J TODD, Generation and testing of pseudo-random numbers. In H. A. Meyer (Ed), Symposium on Monte Carlo Methods, New York Wiley, 1956Google Scholar
- 8 N. ZIERLER, Linear recurslve sequences, J. Soc Indust. Appl. Math. 7, No. 1 (Mar. 1959).Google Scholar
Index Terms
Empirical Tests of an Additive Random Number Generator
Recommendations
Theoretical and empirical convergence results for additive congruential random number generators
Additive Congruential Random Number (ACORN) generators represent an approach to generating uniformly distributed pseudo-random numbers that is straightforward to implement efficiently for arbitrarily large order and modulus; if it is implemented using ...
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 ...
Design of a Random Number Generator from Fingerprint
ICCIS '10: Proceedings of the 2010 International Conference on Computational and Information SciencesSecurity of a cryptographic system depends much on the randomness of random number used in the system. In this paper, a true random number generator based on the data of fingerprint (FPTRNG) is designed which extracts the random information from image ...






Comments