35 search results - page 1 / 7 » Pseudorandom Generators, Measure Theory, and Natural Proofs |
FOCS
1995
IEEE
13 years 9 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
FOCS
2008
IEEE
14 years 12 hour ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...
CCS
2005
ACM
13 years 11 months ago
2005
ACM
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...