Deterministic Extractors for Additive Sources: Extended Abstract

We propose a new model of a weakly random source that admits randomness extraction. Our model of additive sources includes such natural sources as uniform distributions on arithmetic progressions (APs), generalized arithmetic progressions (GAPs), and Bohr sets, each of which generalizes affine sources. We give an explicit extractor for additive sources with linear min-entropy over both Zp and Zn/p, for large prime p, although our results over Zn/p require that the source further satisfy a list-decodability condition. As a corollary, we obtain explicit extractors for APs, GAPs, and Bohr sources with linear min-entropy, although again our results over Zn/p require the list-decodability condition. We further explore special cases of additive sources. We improve previous constructions of line sources (affine sources of dimension 1), requiring a field of size linear in n, rather than Ω(n2) by Gabizon and Raz. This beats the non-explicit bound of Θ(n log n) obtained by the probabilistic method. We then generalize this result to APs and GAPs.

[1]  Ronen Shaltiel,et al.  Dispersers for Affine Sources with Sub-polynomial Entropy , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[2]  ScienceDirect,et al.  Comptes rendus. Mathématique , 2002 .

[3]  Jean Bourgain,et al.  Exponential sum estimates over subgroups ofZ*q,q arbitrary,q arbitrary , 2005 .

[4]  Amir Yehudayoff,et al.  Affine extractors over prime fields , 2011, Comb..

[5]  David Zuckerman,et al.  DETERMINISTIC EXTRACTORS FOR BIT-FIXING SOURCES AND EXPOSURE-RESILIENT CRYPTOGRAPHY , 2003 .

[6]  Eli Ben-Sasson,et al.  Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic , 2012, APPROX-RANDOM.

[7]  J. Chahal.  Equations over Finite Fields , 1988 .

[8]  Ran Raz,et al.  Deterministic extractors for affine sources over large fields , 2008, Comb..

[9]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[10]  Rudolf Lide,et al.  Finite fields , 1983 .

[11]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[12]  Ran Raz,et al.  Deterministic extractors for bit-fixing sources by obtaining an independent seed , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[13]  Zeev Dvir,et al.  Affine extractors over large fields with exponential error , 2015, computational complexity.

[14]  Alfred Geroldinger,et al.  Combinatorial Number Theory and Additive Group Theory , 2009 .

[15]  Jean Bourgain,et al.  Estimates on exponential sums related to the Diffie–Hellman Distributions , 2005 .

[16]  Anup Rao,et al.  Extractors for a constant number of polynomially small min-entropy independent sources , 2006, STOC '06.

[17]  Xin Li,et al.  A New Approach to Affine Extractors and Dispersers , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[18]  Anup Rao,et al.  Extractors for Low-Weight Affine Sources , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[19]  Micha Sharir,et al.  Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[20]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[21]  Jean Bourgain,et al.  Sum–product theorems and exponential sum bounds in residue classes for general modulus , 2007 .

[22]  Eli Ben-Sasson,et al.  Affine dispersers from subspace polynomials , 2009, STOC '09.

[23]  Anup Rao,et al.  An Exposition of Bourgain's 2-Source Extractor , 2007, Electron. Colloquium Comput. Complex..

[24]  Gennady Bachman,et al.  Exponential sums with multiplicative coefficients , 1999 .

[25]  B. M. Fulk.  MATH , 1992 .

[26]  Queens Gate.  Exponential Sums with Multiplicative Coefficients , 1977 .

[27]  Ronen Shaltiel,et al.  Increasing the output length of zero‐error dispersers , 2012, Random Struct. Algorithms.

[28]  Matt DeVos,et al.  Simple Affine Extractors Using Dimension Expansion , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[29]  Jean Bourgain,et al.  On the Construction of Affine Extractors , 2007 .

[30]  Zeev Dvir.  Extractors for varieties , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[31]  Mario Aachen.  Equations Over Finite Fields An Elementary Approach , 2016 .

[32]  M. Ziegler.  Volume 152 of Graduate Texts in Mathematics , 1995 .

[33]  H. Iwaniec,et al.  Analytic Number Theory , 2004 .

[34]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[35]  Ran Raz,et al.  Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[36]  Avi Wigderson,et al.  Extractors And Rank Extractors For Polynomial Sources , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[37]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[38]  Andrew Granville,et al.  Large character sums , 1999, math/9903196.

[39]  W. Schmidt.  Equations over Finite Fields: An Elementary Approach , 1976 .

[40]  A. Weil.  On Some Exponential Sums. , 1948, Proceedings of the National Academy of Sciences of the United States of America.