First Page | Document Content | |
---|---|---|
![]() Date: 2003-04-15 15:57:50Cryptography Computational complexity theory Pseudorandomness Analysis of algorithms Probabilistic complexity theory Pseudorandom function family Randomized algorithm Random number generation Pseudorandom number generator One-way function Advantage IP | Add to Reading List |
![]() | HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP PrimeDocID: 1r25i - View Document |
![]() | Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER,DocID: 1r1z1 - View Document |
![]() | Network Working Group Request for Comments: 4086 BCP: 106 Obsoletes: 1750 Category: Best Current PracticeDocID: 1qWaS - View Document |
![]() | Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡DocID: 1qPOU - View Document |
![]() | SETA 2012 SEquences and Their Applications University of Waterloo, June 4–8, 2012 http://seta2012.uwaterloo.ca General ChairDocID: 1qH4A - View Document |