16 search results - page 2 / 4 » Pseudorandom Generators and Typically-Correct Derandomizatio... |
IACR
2011
12 years 4 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
We give two applications of Nisan–Wigderson-type (“non-cryptographic”) pseudorandom generators in cryptography. Specifically, assuming the existence of an appropriate NW-ty...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
CSR
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
FOCS
1996
IEEE
13 years 9 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...