Statistical Science

Pseudorandom Numbers

Jeffrey C. Lagarias

Full-text: Open access

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.

Article information

Source
Statist. Sci., Volume 8, Number 1 (1993), 31-39.

Dates
First available in Project Euclid: 19 April 2007

Permanent link to this document
https://projecteuclid.org/euclid.ss/1177011081

Digital Object Identifier
doi:10.1214/ss/1177011081

Mathematical Reviews number (MathSciNet)
MR1194441

Zentralblatt MATH identifier
0766.65003

JSTOR
links.jstor.org

Keywords
Computational information theory cryptography data encryption standard discrete exponentiation multiplicative congruential generator one-way function private key cryptosystem pseudorandom numbers RSA public key cryptosystem

Citation

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


Export citation