On epsilon-Biased Generators in NC0

Cryan and Miltersen (Proceedings of the 26th Mathematical Foundations of Computer Science, 2001, pp. 272–284) recently considered the question of whether there can be a pseudorandom generator in NC0, that is, a pseudorandom generator that maps n‐bit strings to m‐bit strings such that every bit of the output depends on a constant number k of bits of the seed.

[1]  Yuval Ishai,et al.  Cryptography in NC0 , 2004, SIAM J. Comput..

[2]  Luca Trevisan,et al.  On e-Biased Generators in NC0 , 2003, FOCS.

[3]  Avi Wigderson,et al.  Extractors: optimal up to constant factors , 2003, STOC '03.

[4]  Ryan O'Donnell,et al.  Learning juntas , 2003, STOC '03.

[5]  Noga Alon,et al.  Explicit unique-neighbor expanders , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[6]  Kenji Obata,et al.  A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[7]  Peter Bro Miltersen,et al.  On Pseudorandom Generators in NC , 2001, MFCS.

[8]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[9]  Eli Ben-Sasson,et al.  Short proofs are narrow-resolution made simple , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[10]  Thomas Johansson,et al.  Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes , 1999, EUROCRYPT.

[11]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[12]  Michael E. Saks,et al.  On the complexity of unsatisfiability proofs for random k-CNF formulas , 1998, STOC '98.

[13]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[14]  Roy Meshulam,et al.  Spaces of Hankel matrices over finite fields , 1995 .

[15]  Michael Kharitonov,et al.  Cryptographic hardness of distribution-specific learning , 1993, STOC.

[16]  Ron M. Roth,et al.  Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.

[17]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[18]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[19]  Moni Naor,et al.  Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[21]  Michael Luby,et al.  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[22]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[23]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[24]  J. Hirschfeld.  Projective Geometries Over Finite Fields , 1980 .

[25]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.