Pseudorandomness from Shrinkage
Journal of the ACM, pp. 1-16, 2019.
One powerful theme in complexity theory and pseudorandomness in the past few decades has been the use of lower bounds to give pseudorandom generators (PRGs). However, the general results using this hardness vs. randomness paradigm suffer from a quantitative loss in parameters, and hence do not give nontrivial implications for models where...More
Full Text (Upload PDF)
PPT (Upload PPT)