Counting irreducible factors of polynomials over a finite field
Discrete Mathematics
Journal of Computer and System Sciences
Randomized algorithms
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
Journal of Computer and System Sciences
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the degrees of irreducible factors of polynomials over a finite field
Discrete Mathematics
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Deterministic Amplification of Space-Bounded Probabilistic Algorithms
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Streaming Computation of Combinatorial Objects
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Simple extractors via constructions of cryptographic pseudo-random generators
Theoretical Computer Science
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
Efficient protocols for privacy preserving matching against distributed datasets
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Simple extractors via constructions of cryptographic pseudo-random generators
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improving the security of MACs via randomized message preprocessing
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Hi-index | 0.00 |
Weak designs were defined in R. Raz, O. Reingold, and S. Vadhan [Extracting all the randomness and reducing the error in Trevisan's extractors, Proc 31st ACM Symp Theory of Computing, Atlanta, GA, May 1999, to appear in J Comput System Sci Special Issue on STOC 99] and are used there in constructions of extractors. Roughly speaking, a weak design is a collection of subsets satisfying some near-disjointness properties. Constructions of weak designs with certain parameters are given in Raz et al. These constructions are explicit in the sense that they require time and space polynomial in the number of subsets. However, the constructions require time and space polynomial in the number of subsets even when needed to output only one specific subset out of the collection. Hence, the constructions are not explicit in a stronger sense. In this work we provide constructions of weak designs (with parameters similar to the ones of Raz et al.) that can be carried out in space logarithmic in the number of subsets. Moreover, our constructions are explicit even in a stronger sense: Given an index to a subset, we output the specified subset in time and space polynomial in the size of the index. Using our constructions, we obtain extractors similar to some of the ones given in Raz et al. in terms of parameters, and that can be evaluated in logarithmic space. Our main construction is algebraic. In order to prove the properties of weak designs, we prove some algebro-combinatorial lemmas that may be interesting in their own right. These lemmas regard the number of roots of polynomials over finite fields. In particular, we prove that the number of polynomials (over any finite field) with k roots, vanishes exponentially in k. In other words, we prove that the number of roots of a random polynomial is not only bounded by its degree (a well-known fact), but, furthermore, it is concentrated exponentially around its expectation (which is 1). Our lemmas are proved by algebro-combinatorial arguments. The main lemma is also proved by a probabilistic argument.