Advertisement

Deterministic Extractors for Affine Sources over Large Fields

  • Ariel GabizonEmail author
Chapter
  • 427 Downloads
Part of the Monographs in Theoretical Computer Science. An EATCS Series book series (EATCS)

Summary

An \((n,k)\)-affine source over a finite field \({\mathbb F}\) is a random variable \(X=(X_1,...,X_n) \in {\mathbb F}^n\), which is uniformly distributed over an (unknown) k-dimensional affine subspace of \({\mathbb F}^n\). We show how to (deterministically) extract practically all the randomness from affine sources, for any field of size larger than \(n^c\) (where c is a large enough constant). This chapter is based on [25].

Keywords

Finite Field Field Size Affine Subspace Multiplicative Character Nonzero Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Bibliography

  1. 1.
    N. Alon. Tools from higher algebra. In R. L. Graham & M. Grotschel & L. Lovasz (eds.), Handbook of Combinatorics, Elsevier and The MIT Press, volume 2. 1995.Google Scholar
  2. 2.
    N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, volume II, pages 544–553, 1990.Google Scholar
  3. 4.
    B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsay graphs, dispersers, and extractors. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 1–10, 2005.Google Scholar
  4. 10.
    J. Bourgain. On the construction of affine extractors.Geometric And Functional Analysis, 17(1):33–57, 2007.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 22.
    A. Elbaz. Improved constructions for extracting quasi-random bits from sources of weak randomness.M.Sc. Thesis, Weizmann Institute, 2003.Google Scholar
  6. 25.
    A. Gabizon and R. Raz. Deterministic extractors for affine sources over large fields. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 407–418, 2005.Google Scholar
  7. 26.
    A.Gabizon, R. Raz, and R. Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed.SICOMP: SIAM Journal on Computing, 36(4):1072–1094, 2006.MathSciNetzbMATHCrossRefGoogle Scholar
  8. 33.
    R. L. Graham and J. H. Spencer. A constructive solution to a tournament problem.Canad. Math. Bull., 14:45–48, 1971.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 35.
    A. Hales and R. Jewett. Regularity and positional games.Trans. Amer. Math. Soc., 106:222–229, 1963.MathSciNetzbMATHCrossRefGoogle Scholar
  10. 45.
    M. Naor, A. Nussboim, and E. Tromer. Efficiently constructible huge graphs that preserve first order properties of random graphs. In TCC, pages 66–85, 2005.Google Scholar
  11. 55.
    R. Raz, O. Reingold, and S. Vadhan. Extracting all the randomness and reducing the error in Trevisan’s extractors. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 149–158, 1999.Google Scholar
  12. 59.
    W. M. Schmidt. Equations over Finite Fields: An Elementary Approach, volume 536. Springer-Verlag, Lecture Notes in Mathematics, 1976.Google Scholar
  13. 64.
    R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.Google Scholar
  14. 65.
    A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. In IEEE, editor, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 638–647, 2001. IEEE Computer Society Press.Google Scholar
  15. 66.
    L. Trevisan. Construction of extractors using pseudorandom generators. In Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.Google Scholar
  16. 72.
    A. Weil. On some exponential sums. In Proc. Nat. Acad. Sci. USA, volume 34, pages 204–207, 1948.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Dept. Computer ScienceUniversity of Texas at AustinAustinUSA

Personalised recommendations