ABSTRACT
The following paper investigates the implementation and performance of random number generators on small word-length machines. Four generators are presented, two existing forms of the linear congruential generator, a new generator proposed by Král specifically for small word-length machines, and a new generator proposed by the authors referred to as the quadratic random number generator. Theoretical results are presented for determining the period of the quadratic generator. Test results indicate the linear congruential generators are not suitable for use on a small word-length machine while Král's generator and the quadratic method appear to be acceptable.
- 1.Knuth, Donald E. The Art of Computer programming: Volume 2 / Seminumerical Algorithms, Addison-Wesley, 1969. Google Scholar
Digital Library
- 2.Hammer, Preston C. "The Mid-Square Method of Generating Digits," National Bureau of Standards, Applied Mathematics Series, 12 (1951), 33.Google Scholar
- 3.Metropolis, N. "Phase Shifts - Middle Squares - Wave Equation," Symposium on Monte Carlo Methods, John Wiley, 1956, 29-36.Google Scholar
- 4.Lehmer, Derrick H. "Mathematical Methods in Large-Scale Computing Units," Proceedings of the Second Symposium on Large-Scale Digital Computing Machinery, Harvard University Press, 1951, 141-145.Google Scholar
- 5.Taussky, Olga and John Todd. "Generation and Testing of Pseudo-Random Numbers," Symposium on Monte Carlo Methods, John Wiley, 1956, 15-28.Google Scholar
- 6.Green, B. F., J.E. Smith and L. Klem. "Empirical Tests of an Additive Random Number Generator," Journal of the Association for Computing Machinery, 6 (1959), 527-537. Google Scholar
Digital Library
- 7.Miller, J. C. and M. J. Prentice. "Additive Congruential Pseudo-Random Number Generators," Computer Journal, 11 (3): November 1968, 341-346.Google Scholar
- 8.MacLaren, M. D. and George Marsaglia. "Uniform Random Number Generators," Journal of the Association for Computing Machinery, 12 (1): January 1965, 83-89. Google Scholar
Digital Library
- 9.Král, Jaroslav. "A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths," Information Processing Letters, 1 (1972), 164-167 (erratum noted in 1 (1972), 216.)Google Scholar
Cross Ref
- 10.Hull, T. E., and A. R. Dobell. "Random Number Generators," Society for Industrial and Applied Mathematics Review, 4 (3): July 1962, 230-254.Google Scholar
Digital Library
- 11.Overstreet, Claude, Jr. "The Quadratic Congruential Method of Random Number Generation," Unpublished Ph.D. Dissertation, Southern Methodist University, May 1973. Google Scholar
Digital Library
Index Terms
A random number generator for small word-length computers
Recommendations
A compact gaussian random number generator for small word lengths
ARC'11: Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applicationsThe architecture for a compact Gaussian Random Number Generator based on the inversion of the gaussian cdf for word lengths less than 8 bits is discussed. The generator occupies 10% of area of conventional 16 or 32 bit GRNG implementations and thus can ...
Uniform Random Number Generator Using Leap Ahead LFSR Architecture
ICCCS '09: Proceedings of the 2009 International Conference on Computer and Communications SecurityUniform Random Number Generator (URNG) is a key element in most applications which run on FPGA based hardware accelerators. As multi-bits is required and a normal LFSR could only generate one bit per cycle, more than one LFSR is needed in a URNG. In ...
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