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.
"Pseudorandom Numbers." Statist. Sci. 8 (1) 31 - 39, February, 1993. https://doi.org/10.1214/ss/1177011081