Empirical Tests of an Additive Random Number Generator

Authors:
Bert F. Green, Jr.;J. E. Keith Smith;Laura Klem
Affiliations:
Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, Mass.;Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, Mass.;Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, Mass.
Venue:
Journal of the ACM (JACM)
Year:
1959

Citing 0
Cited 7

Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography

ACM Computing Surveys (CSUR)
Quality evaluation of some combinations of unit uniform random number generators and unit normal transformation algorithms

ANSS '81 Proceedings of the 14th annual symposium on Simulation
A random number generator for small word-length computers

ACM '73 Proceedings of the ACM annual conference
Parallelism in computer organization random number generation in the fixed-plus-variable computer system

IRE-AIEE-ACM '61 (Western) Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference
Fast "infinite-key" privacy transformation for resource-sharing systems

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Cryptography using modular software elements

AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Random number generators with period divisible by a Mersenne prime

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI

Quantified Score

Hi-index	0.00

Visualization

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