Pseudorandom Numbers
Jeffrey C. Lagarias
Abstract
Open-access reader
Jeffrey C. Lagarias
Abstract
Open-access reader
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.
OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Pseudorandom number generator, Pseudorandom generator, Pseudorandom generator theorem, Pseudorandomness, Pseudorandom function family, Random seed, Generator (circuit theory), Random number generation