How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Reductions in circuit complexity: an isomorphism theorem and a gap theorem
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Synthesizers and their application to the parallel construction of pseudo-random functions
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Lower bounds for pseudorandom number generators
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Verifying proofs in constant depth
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Cryptography in constant parallel time
Cryptography in constant parallel time
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
On pseudorandom generators with linear stretch in NC0
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Pseudorandom generators with long stretch and low locality from random local one-way functions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A dichotomy for local small-bias generators
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
ACM Computing Surveys (CSUR)
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
In this paper we consider the question of whether NCo circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show • Generators computed by NCo circuits where each output bit depends on at most 3 input bits (i.e, NC3o circuits) and with stretch factor greater than 4 are not pseudorandom. • A large class of "non-problematic" NCo generators with superlinear stretch (including all NC3o generators with superlinear stretch) are broken by a statistical test based on a linear dependency test combined with a pairwise independence test. • There is an NC4o generator with a super-linear stretch that passes the linear dependency test as well as k-wise independence tests, for any constant k.