• DocumentCode
    2834311
  • Title

    Simple Affine Extractors Using Dimension Expansion

  • Author

    DeVos, Matt ; Gabizon, Ariel

  • Author_Institution
    Dept. of Comput. Sci., Simon Fraser Univ., Vancouver, BC, Canada
  • fYear
    2010
  • fDate
    9-12 June 2010
  • Firstpage
    50
  • Lastpage
    57
  • Abstract
    Let Fq be the field of q elements. An (n, k)-affine extractor is a mapping D : Fqn→ {0,1} such that for any k-dimensional affine subspace X ⊆ Fqn, D(x) is an almost unbiased bit when x is chosen uniformly from X. Loosely speaking, the problem of explicitly constructing affine extractors gets harder as q gets smaller and easier as k gets larger. This is reflected in previous results: When q is ´large enough´, specifically q = Ω(n2), Gabizon and Raz construct affine extractors for any k ≥ 1. In the ´hardest case´, i.e. when q = 2, Bourgain constructs affine extractors for k ≥ δn for any constant (and even slightly subconstant) δ > 0. Our main result is the following: Fix any k ≥ 2 and let d = 5n/k. Then whenever q > 2 · d2 and p = char(Fq) > d, we give an explicit (n, k)-affine extractor. For example, when k = δn for constant δ > 0, we get an extractor for a field of constant size Ω((1/δ)2). We also get weaker results for fields of arbitrary characteristic (but can still work with a constant field size when k = δn for constant δ > 0). Thus our result may be viewed as a ´field-size/dimension´ tradeoff for affine extractors. For a wide range of k this gives a new result, but even for large k where we do not improve (or even match) the previous result of, we believe that our construction and proof have the advantage of being very simple: Assume n is prime and d is odd, and fix any non-trivial linear map T : Fqn→ Fq. Define QR : Fq → {0,1} by QR(x) = 1 if and only if x is a quadratic residue. Then, the function D : Fqn → {0,1} defined by D(x) = QR(T(xd)) is an (n, k)-affine extractor. Our proof uses a result of H- - eur, Leung and Xiang giving a lower bound on the dimension of products of subspaces.
  • Keywords
    Boolean functions; theorem proving; affine extractors; dimension expansion; field-size/dimension tradeoff; k-dimensional affine subspace; Computational complexity; Computer science; Distributed computing; Measurement standards; Extractors; affine extractors; derandomization; dimension expansion; pseudorandomness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity (CCC), 2010 IEEE 25th Annual Conference on
  • Conference_Location
    Cambridge, MA
  • ISSN
    1093-0159
  • Print_ISBN
    978-1-4244-7214-7
  • Electronic_ISBN
    1093-0159
  • Type

    conf

  • DOI
    10.1109/CCC.2010.14
  • Filename
    5497900