Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Efficient non-interactive secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Fast correlation attacks: methods and countermeasures
FSE'11 Proceedings of the 18th international conference on Fast software encryption
Verifying proofs in constant depth
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
The Complexity of Distributions
SIAM Journal on Computing
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
Hi-index | 0.00 |
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.They show that for k = 3, if m ≥ 4n + 1, there is a distinguisher; in fact, they show that in this case it is possible to break the generator with a linear test, that is, there is a subset of bits of the output whose XOR has a noticeable bias.They leave the question open for k ≥ 4. In fact, they ask whether every NC0 generator can be broken by a statistical test that simply XORs some bits of the input. Equivalently, is it the case that no NC0 generator can sample an ε-biased space with negligible ε?We give a generator for k = 5 that maps n bits into cn bits, so that every bit of the output depends on 5 bits of the seed, and the XOR of every subset of the bits of the output has bias 2-Ω(n/c4). For large values of k, we construct generators that map n bits to $n^{\Omega(\sqrt{k})}$ bits such that every XOR of outputs has bias $2^{-{n^{{1 \over 2\sqrt k}}}}$.We also present a polynomial-time distinguisher for k = 4,m ≥ 24n having constant distinguishing probability. For large values of k we show that a linear distinguisher with a constant distinguishing probability exists once m ≥ Ω(2kn⌈k/2⌉).Finally, we consider a variant of the problem where each of the output bits is a degree k polynomial in the inputs. We show there exists a degree k = 2 pseudorandom generator for which the XOR of every subset of the outputs has bias 2-Ω(n) and which maps n bits to Ω(n2) bits. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006