We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Some Implications of Complexity Theory on Pseudo-random Bit Generation

Thumbnail Image
Download
Name

MIT-LCS-TR-336.pdf

Size

2.13 MB

Format

Adobe PDF

Checksum (MD5)

2bee0c8190e192096d3f0c498fbc1967

Author(s)
Trilling, Stephen
Advisor(s)
Sipser, Michael
Date Issued
January 1985
Series/Report no.
MIT-LCS-TR-336
Abstract
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.