Random Number Generators
In contemporary computation there is an almost unquenchable thirst for random numbers. One particularly intemperate class of customers is comprised of the diverse Monte Carlo methods.1 Or one may want to study a problem (or control a process) that depends on several parameters which one doesn’t know how to choose. In such cases random choices are often preferred, or simply convenient. Finally, in system analysis (including biological systems) random “noise” is often a preferred test signal. And, of course, random numbers are useful — to say the least — in cryptography.
KeywordsRandom Number Generator Secret Message Period Length Pseudorandom Sequence Geiger Counter
Unable to display preview. Download preview PDF.
- 27.1F.J. MacWilliams, N.J.A. Sloane: The Theory of Error-Correcting Codes (North-Holland, Amsterdam 1978)Google Scholar
- 27.2G. Hoffmann de Visme: Binary Sequence (The English University Press, London 1971)Google Scholar
- 27.5E. N. Gilbert: Unpublished notes (1953)Google Scholar
- 27.6T. Herlestan: “On the Complexity of Functions of Linear Shift Register Sequences,” in Proceedings of the International Symposium on Information Theory (IEEE, New York 1982) p. 166Google Scholar
- 27.7H. J. Baker, F. C. Piper: Communications security, a survey of cryptography. IEE Proc. A 129, No.6, 357–376 (1982)Google Scholar
- 27.10N.J. A. Sloane: “Encrypting by Random Rotations,” in [Ref. 27.11] pp. 71–128Google Scholar