We study pseudorandom generator (PRG) constructions Gf: f0; 1gl! f0; 1gl+s from one-way functions f: f0; 1gn! f0; 1gm. We consider PRG constructions of the form Gf (x) = C(f(q1) : : : f(qpoly(n))) where C is a polynomial-size constant depth circuit (i.e. AC 0) and C and the q's are generated from x arbitrarily. We show that every black-box PRG construction of this form must have stretch s bounded as s l (logO(1) n)=m + O(1) = o(l). This holds even if the PRG construction starts from a one-to-one function f: f0; 1gn! f0; 1gm where m 5n. This shows that either adaptive queries or sequential computation are necessary for black-box PRG constructions with constant factor stretch (i.e. s = (l)) from one-way functions, even if the functi...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
Existing proofs that deduce BPP=P from circuit lower bounds convert randomized algorithms into deter...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
We study pseudorandom generator (PRG) constructions G f: {0, 1} l → {0, 1} l+s from one-way function...
We study the complexity of building pseudorandom generators (PRGs) from hard functions. We show that...
We continue the study of locally-computable pseudorandom generators (PRG) G: {0, 1}n → {0, 1}m such ...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
We give an explicit pseudorandom generator (PRG) for read-once $\mathbf{AC}^0$, i.e., constant-depth...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
We give an explicit pseudorandom generator (PRG) for read-once $\mathbf{AC}^0$, i.e., constant-depth...
In the first part of this thesis, we consider the construction of unconditional pseudorandom generat...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
Existing proofs that deduce BPP=P from circuit lower bounds convert randomized algorithms into deter...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
Existing proofs that deduce BPP=P from circuit lower bounds convert randomized algorithms into deter...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
We study pseudorandom generator (PRG) constructions G f: {0, 1} l → {0, 1} l+s from one-way function...
We study the complexity of building pseudorandom generators (PRGs) from hard functions. We show that...
We continue the study of locally-computable pseudorandom generators (PRG) G: {0, 1}n → {0, 1}m such ...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
We give an explicit pseudorandom generator (PRG) for read-once $\mathbf{AC}^0$, i.e., constant-depth...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
We give an explicit pseudorandom generator (PRG) for read-once $\mathbf{AC}^0$, i.e., constant-depth...
In the first part of this thesis, we consider the construction of unconditional pseudorandom generat...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
Existing proofs that deduce BPP=P from circuit lower bounds convert randomized algorithms into deter...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
Existing proofs that deduce BPP=P from circuit lower bounds convert randomized algorithms into deter...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...