Some Implications of Complexity Theory on Pseudo-random Bit Generation
| dc.contributor.advisor | Sipser, Michael | en_US |
| dc.contributor.author | Trilling, Stephen | en_US |
| dc.date.accessioned | 2023-03-29T15:11:12Z | |
| dc.date.available | 2023-03-29T15:11:12Z | |
| dc.date.issued | 1985-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149607 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-336 | |
| dc.title | Some Implications of Complexity Theory on Pseudo-random Bit Generation | en_US |
| dc.identifier.oclc | 13326232 |
