Pseudorandom generators without the XOR Lemma (Extended Abstract)

DMCA

Pseudorandom generators without the XOR Lemma (Extended Abstract) (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Madhu Sudan , Luca Trevisan , Salil Vadhan

Citations:

137 - 23 self

BibTeX

@MISC{Sudan98pseudorandomgenerators,
    author = {Madhu Sudan and Luca Trevisan and Salil Vadhan},
    title = {Pseudorandom generators without the XOR Lemma (Extended Abstract)},
    year = {1998}
}

OpenURL

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 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 Lemma, and a second derandomized XOR Lemma) that are composed with the Nisan-- Wigderson [NW94] generator. In this paper we present two different approaches to proving the main result of Impagliazzo and Wigderson. In developing each approach, we introduce new techniques and prove new results that could be useful in future improvements and/or applications of hardness-randomness trade-offs. Our first result is that when (a modified version of) the NisanWigderson generator construction is applied with a "mildly" hard predicate, the result is a generator that produces a distribution indistinguishable from having large min-entropy. An extractor can then be used to produce a distribution computationally indistinguishable from uniform. This is the first construction of a pseudorandom generator that works with a mildly hard predicate without doing hardness amplification. We then show that in the Impagliazzo--Wigderson construction only the first hardness-amplification phase (encoding with multivariate polynomial) is necessary, since it already gives the required average-case hardness. We prove this result by (i) establishing a connection between the hardness-amplification problem and a listdecoding...

Keyphrases

pseudorandom generator xor lemma hard predicate hardness amplification second derandomized xor lemma circuit complexity different approach multivariate polynomial encoding decision problem solvable main result first construction future improvement nisan wigderson nw94 generator good pseudorandom generator new result new technique large min-entropy hardness-amplification problem hardness-randomness trade-off required average-case hardness multivariate polynomial impagliazzo wigderson construction distribution indistinguishable wigderson iw97 nisanwigderson generator construction first result first hardness-amplification phase

DMCA