Open Access
Translator Disclaimer
February, 1993 Pseudorandom Numbers
Jeffrey C. Lagarias
Statist. Sci. 8(1): 31-39 (February, 1993). DOI: 10.1214/ss/1177011081

Abstract

This article surveys the problem of generating pseudorandom numbers and lists many of the known constructions of pseudorandom bits. It outlines the subject of computational information theory. In this theory the fundamental object is a secure pseudorandom bit generator. Such generators are not theoretically proved to exist, although functions are known that appear to possess the required properties. In any case, pseudorandom number generators are known that work reasonably well in practice.

Citation

Download Citation

Jeffrey C. Lagarias. "Pseudorandom Numbers." Statist. Sci. 8 (1) 31 - 39, February, 1993. https://doi.org/10.1214/ss/1177011081

Information

Published: February, 1993
First available in Project Euclid: 19 April 2007

zbMATH: 0766.65003
MathSciNet: MR1194441
Digital Object Identifier: 10.1214/ss/1177011081

Rights: Copyright © 1993 Institute of Mathematical Statistics

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.8 • No. 1 • February, 1993
Back to Top