Some Implications of Complexity Theory on Pseudo-random Bit Generation
Author(s)
Trilling, StephenAbstract
A recent area of interest in theoretical computer science has been in the construction of so-called pseudo-random bit generators. These generators "stretch" a short sequence of truly random bits into a longer sequence of "pseudo-random" bits. These bits are sufficiently indistinguishable from truly random bits to be useful in deterministic simulation of probabilistic computation.
Date issued
1985-01Series/Report no.
MIT-LCS-TR-336