Results 1 - 10 of 58,424

Pseudorandom generators in . . .

by Michael Alekhnovich, Eli Ben-sasson, Alexander A. Razborov, Avi Wigderson , 2003
"... We call a pseudorandom generator Gn: {0, 1} n → {0, 1} m hard for a propositional proof system P if P can not efficiently prove the (properly encoded) statement Gn(x1,..., xn) = b for any string b ∈ {0, 1} m. We consider a variety of “combinatorial” pseudorandom generators inspired by the Nisan-Wig ..."
Abstract - Add to MetaCart
We call a pseudorandom generator Gn: {0, 1} n → {0, 1} m hard for a propositional proof system P if P can not efficiently prove the (properly encoded) statement Gn(x1,..., xn) = b for any string b ∈ {0, 1} m. We consider a variety of “combinatorial” pseudorandom generators inspired by the Nisan

Pseudorandom generators for space-bounded computation

by Noam Nisan - Combinatorica , 1992
"... Pseudorandom generators are constructed which convert O(SlogR) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(Slogn) random bits. An application of these ..."
Abstract - Cited by 245 (11 self) - Add to MetaCart
Pseudorandom generators are constructed which convert O(SlogR) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(Slogn) random bits. An application

Extractors and Pseudorandom Generators

by Luca Trevisan - Journal of the ACM , 1999
"... We introduce a new approach to constructing extractors. Extractors are algorithms that transform a "weakly random" distribution into an almost uniform distribution. Explicit constructions of extractors have a variety of important applications, and tend to be very difficult to obtain. ..."
Abstract - Cited by 113 (6 self) - Add to MetaCart
We introduce a new approach to constructing extractors. Extractors are algorithms that transform a "weakly random" distribution into an almost uniform distribution. Explicit constructions of extractors have a variety of important applications, and tend to be very difficult to obtain.

Pseudorandom Generators for Combinatorial Checkerboards

by Thomas Watson , 2011
"... We define a combinatorial checkerboard to be a function f: {1,...,m} d → {1, −1} of the form f(u1,...,ud) = ∏d i=1 fi(ui) for some functions fi: {1,...,m} → {1, −1}. This is a variant of combinatorial rectangles, which can be defined in the same way but using {0, 1} instead of {1, −1}. We consider ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
consider the problem of constructing explicit pseudorandom generators for combinatorial checkerboards. This is a generalization of small-bias generators, which correspond to the case m = 2. We construct a pseudorandom generator that ǫ-fools all combinatorial checkerboards with seed length O () 3/2 1 log m

Pseudorandom generators without the XOR Lemma

by Madhu Sudan, Luca Trevisan, Salil Vadhan , 1998
"... Madhu Sudan y Luca Trevisan z Salil Vadhan x Abstract Impagliazzo and Wigderson [IW97] have recently shown that if there exists a decision problem solvable in time 2 O(n) and having circuit complexity 2 n) (for all but finitely many n) then P = BPP. This result is a culmination of a serie ..."
Abstract - Cited by 137 (21 self) - Add to MetaCart
series of works showing connections between the existence of hard predicates and the existence of good pseudorandom generators. The construction of Impagliazzo and Wigderson goes through three phases of "hardness amplification" (a multivariate polynomial encoding, a first derandomized XOR

State Recovery Attacks on Pseudorandom Generators

by Andrey Sidorenko, Berry Schoenmakers
"... Abstract: State recovery attacks comprise an important class of attacks on pseudorandom generators. In this paper we analyze resistance of pseudorandom generators against these attacks in terms of concrete security. We show that security of the Blum-Micali pseudorandom generator against state recove ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Abstract: State recovery attacks comprise an important class of attacks on pseudorandom generators. In this paper we analyze resistance of pseudorandom generators against these attacks in terms of concrete security. We show that security of the Blum-Micali pseudorandom generator against state

On pseudorandom generators in NC0?

by unknown authors
"... Abstract. In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show* Generators computed by NC0 circuits where each output bit depends on at most 3 input bits (i.e, NC03 circuits) and with stretch f ..."
Abstract - Add to MetaCart
Abstract. In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show* Generators computed by NC0 circuits where each output bit depends on at most 3 input bits (i.e, NC03 circuits) and with stretch

On Constructing Parallel Pseudorandom Generators

by From One-Way Functions, Emanuele Viola - In Proc. 20th Conference on Computational Complexity (CCC , 2005
"... We study pseudorandom generator (PRG) constructions G from one-way functions f : . We consider PRG constructions of the form G (x) = C(f(q 1 ) . . . f(q poly(n) )) where C is a polynomial-size constant depth circuit (i.e. AC ) and C and the q's are generated from x arbit ..."
Abstract - Add to MetaCart
We study pseudorandom generator (PRG) constructions G from one-way functions f : . We consider PRG constructions of the form G (x) = C(f(q 1 ) . . . f(q poly(n) )) where C is a polynomial-size constant depth circuit (i.e. AC ) and C and the q's are generated from x

Language Compression and Pseudorandom Generators

by Harry Buhrman , Troy Lee , Dieter Van Melkebeek
"... The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given a mem-bership oracle for A. We study randomized and nondeterministic decompression schemes andinvestigate how close we ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
string. The latter lower bound is tight up to an additiveterm of O(log n).The key ingredient for our upper bounds is the relativizable hardness versus randomness tradeoffs based on the Nisan-Wigderson pseudorandom generator construction.

Robust Pseudorandom Generators

by Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman , 2013
"... Let G: {0, 1} n → {0, 1} m be a pseudorandom generator. We say that a circuit implementation of G is (k, q)-robust if for every set S of at most k wires anywhere in the circuit, there is a set T of at most q|S | outputs, such that conditioned on the values of S and T the remaining outputs are pseudo ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Let G: {0, 1} n → {0, 1} m be a pseudorandom generator. We say that a circuit implementation of G is (k, q)-robust if for every set S of at most k wires anywhere in the circuit, there is a set T of at most q|S | outputs, such that conditioned on the values of S and T the remaining outputs
Results 1 - 10 of 58,424