General weak random sources

The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta >0. A pseudorandom generator that runs in time n/sup O(log n)/ and simulates RP using as a seed a string from such a source is exhibited. Under the generalized Paley graph conjecture, a generator that runs in polynomial time and simulates RP is given, as well as a different generator that produces almost perfectly random bits at a rate arbitrarily close to optimal using as seeds strings from a constant number of independent weak random sources.<<ETX>>

[1]  Miklos Santha,et al.  Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.

[2]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[3]  Vojtech Rödl,et al.  Two lower bounds for branching programs , 1986, STOC '86.

[4]  Manuel Blum.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..

[5]  Umesh V. Vazirani,et al.  Efficiency considerations in using semi-random sources , 1987, STOC.

[6]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[7]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Loo Keng Hua,et al.  Introduction to number theory , 1982 .

[10]  Endre Szemerédi,et al.  Two infinite sets of primes with fast primality tests , 1988, STOC '88.

[11]  Avi Wigderson,et al.  Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  V. Shoup.  New algorithms for finding irreducible polynomials over finite fields , 1990 .

[13]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[14]  V. Vazirani,et al.  Random Polynomial Time is Equal to Semi-Random Polynomial Time , 1988 .

[15]  Umesh V. Vazirani,et al.  Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..

[16]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[17]  Manuel Blum,et al.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..

[18]  Noam Nisan,et al.  The computational complexity of universal hashing , 1990, STOC '90.

[19]  Michael E. Saks,et al.  Imperfect random sources and discrete controlled processes , 1987, STOC.