Results 1  10
of
200,502
PseudoRandom Generators for All Hardnesses
"... ABSTRACT We construct the first pseudorandom generators with logarithmic seed length that convert s bits of hardness into s \Omega (1) bits of 2sided pseudorandomness for any s. This ..."
Abstract
 Add to MetaCart
ABSTRACT We construct the first pseudorandom generators with logarithmic seed length that convert s bits of hardness into s \Omega (1) bits of 2sided pseudorandomness for any s. This
Pseudorandom generators for all hardness
 Journal of Computer and System Science
, 2003
"... A pseudorandom generator (PRG) is a function that “stretches ” a short random seed into a longer pseudorandom output string that “fools ” small circuits: Definition 1 (ɛPRG) An ɛPRG for size s is a function G: {0, 1} t →{0, 1} m such that for all circuits C of size at most s:  Pr[C(G(z))=1]−Pr[ ..."
Abstract

Cited by 58 (8 self)
 Add to MetaCart
A pseudorandom generator (PRG) is a function that “stretches ” a short random seed into a longer pseudorandom output string that “fools ” small circuits: Definition 1 (ɛPRG) An ɛPRG for size s is a function G: {0, 1} t →{0, 1} m such that for all circuits C of size at most s:  Pr[C(G(z))=1]−Pr
On the pseudorandom generator ISAAC
"... Abstract. This paper presents some properties of he deterministic random bit generator ISAAC (FSE’96), contradicting several statements of its introducing article. In particular, it characterizes huge subsets of internal states which induce a strongly nonuniform distribution in the 8 192 first bits ..."
Abstract
 Add to MetaCart
Abstract. This paper presents some properties of he deterministic random bit generator ISAAC (FSE’96), contradicting several statements of its introducing article. In particular, it characterizes huge subsets of internal states which induce a strongly nonuniform distribution in the 8 192 first
On the pseudorandom generator ISAAC
"... Abstract. This paper presents some properties of he deterministic random bit generator ISAAC (FSE’96), contradicting several statements of its introducing article. In particular, it characterizes huge subsets of internal states which induce a strongly nonuniform distribution in the 8 192 first bits ..."
Abstract
 Add to MetaCart
Abstract. This paper presents some properties of he deterministic random bit generator ISAAC (FSE’96), contradicting several statements of its introducing article. In particular, it characterizes huge subsets of internal states which induce a strongly nonuniform distribution in the 8 192 first
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 854 (18 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
Proving lower bounds via pseudorandom generators
 FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 1518, 2005, Proceedings, volume 3821 of Lecture
, 2005
"... Abstract. In this paper, we formalize two stepwise approaches, based on pseudorandom generators, for proving P � = NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits. 1 ..."
Abstract

Cited by 54 (3 self)
 Add to MetaCart
Abstract. In this paper, we formalize two stepwise approaches, based on pseudorandom generators, for proving P � = NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits. 1
Limits on the stretch of nonadaptive constructions of pseudorandom generators
, 2011
"... Abstract. The standard approach for constructing a largestretch pseudorandom generator given a oneway permutation or given a smallerstretch pseudorandom generator involves repeatedly composing the given primitive with itself. In this paper, we consider whether this approach is necessary, that ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. The standard approach for constructing a largestretch pseudorandom generator given a oneway permutation or given a smallerstretch pseudorandom generator involves repeatedly composing the given primitive with itself. In this paper, we consider whether this approach is nec
The Monte Carlo Algorithm With A PseudoRandom Generator
 Math. Comp
, 1989
"... . We analyze the Monte Carlo algorithm for the approximation of multivariate integrals when a pseudorandom generator is used. We establish lower and upper bounds on the error of such algorithms. We prove that as long as a pseudorandom generator is capable of producing only finitely many points, th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. We analyze the Monte Carlo algorithm for the approximation of multivariate integrals when a pseudorandom generator is used. We establish lower and upper bounds on the error of such algorithms. We prove that as long as a pseudorandom generator is capable of producing only finitely many points
Design of a Remotely Controlled PseudoRandom Generator With Local Time Gating
"... Design of a remotely controlled pseudorandom generator with local time gating ..."
Abstract
 Add to MetaCart
Design of a remotely controlled pseudorandom generator with local time gating
Tautologies From PseudoRandom Generators
, 2001
"... We consider tautologies formed from a pseudorandom number generator, dened in Krajcek [12] and in Alekhnovich et.al. [2]. We explain a strategy of proving their hardness for EF via a conjecture about bounded arithmetic formulated in Krajcek [12]. Further we give a purely nitary statement, in a ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We consider tautologies formed from a pseudorandom number generator, dened in Krajcek [12] and in Alekhnovich et.al. [2]. We explain a strategy of proving their hardness for EF via a conjecture about bounded arithmetic formulated in Krajcek [12]. Further we give a purely nitary statement, in a
Results 1  10
of
200,502