• DocumentCode
    3269116
  • Title

    Extractors for Varieties

  • Author

    Dvir, Zeev

  • Author_Institution
    Inst. for Adv. Study, Princeton, NJ, USA
  • fYear
    2009
  • fDate
    15-18 July 2009
  • Firstpage
    102
  • Lastpage
    113
  • Abstract
    We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a function (an extractor) whose output is close to uniform even if the input is drawn uniformly from the set of solutions of an unknown system of low degree polynomials. This problem generalizes the problem of extraction from affine sources which has drawn a considerable amount of interest lately. We present two constructions of explicit extractors for varieties. The first works for varieties of any size (including one dimensional varieties, or curves) and requires field size which is exponential in the overall dimension of the space. Our second extractor allows the field size to be polynomial in the degree of the equations defining the variety, but works only for varieties whose size is at least the square root of the total size of the space.
  • Keywords
    algebra; polynomials; affine sources; algebraic variety; extractors; low degree polynomials; randomness extraction; Approximation methods; Computational complexity; Cryptography; Entropy; Equations; Polynomials; Random variables; Sampling methods; Turing machines; USA Councils; algebraic geometry; derandomization; explicit constructions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2009. CCC '09. 24th Annual IEEE Conference on
  • Conference_Location
    Paris
  • ISSN
    1093-0159
  • Print_ISBN
    978-0-7695-3717-7
  • Type

    conf

  • DOI
    10.1109/CCC.2009.7
  • Filename
    5231245