Extractors for Varieties

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 102-113

  Dvir, Zeev ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC VARIETIES; FIELD SIZE; LOW DEGREE; SQUARE ROOTS;

COMPUTATIONAL COMPLEXITY;

EID: 70350641078     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2009.7     Document Type: Conference Paper

References (24)

1. B. Barak, A. Rao, R. Shaltiel, and A. Wigderson. 2- source dispersers for sub-polynomial entropy and ramsey graphs beating the frankl-wilson construction. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 671-680, New York, NY, USA, 2006. ACM Press.
2. E. Bombieri. On exponential sums in finite fields. American Journal of Mathematics, 88: 71-105, 1966.
3. J. Bourgain. On the construction of affine extractors. Geometric and Functional Analysis, 17(1): 33-57, 2007.
4. Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, and David Pointcheval. The twist-augmented technique for key exchange. In Moti Yung, Yevgeniy Dodis, Aggelos Kiayias, and Tal Malkin, editors, Public Key Cryptography, volume 3958 of Lecture Notes in Computer Science, pages 410-426. Springer, 2006.
5. Benny Chor, Oded Goldreich, Johan Hastad, Joel Friedman, Steven Rudich, and Roman Smolensky. The bit extraction problem of t-resilient functions (preliminary version). In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 396-407, 1985.
6. D. Cox, J. Little, and D. O'shea. Ideals, Varieties and Algorithms. Springer, 1992.
7. V. Danilov. Algebraic varieties and schemes. In I. Shafarevich (Ed.), Algebraic Geometry I, Encyclopedia of Mathematical Sciences, Vol. 23, , pages 167-297, Berlin, 1994. Springer.
8. P. Deligne. La conjecture de weil. I, Inst. Hautes Etudes Sci. Publ. Math., 43: 273-307, 1974.
9. Z. Dvir, A. Gabizon, and A. Wigderson. Extractors and rank extractors for polynomial sources. In FOCS '07, 2007.
10. 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, Washington, DC, USA, 2005. IEEE Computer Society.
11. A. Gabizon, R. Raz, and R. Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 394-403, Washington, DC, USA, 2004. IEEE Computer Society.
12. O. Goldreich. Three XOR-lemmas - an exposition. Electronic Colloquium on Computational Complexity (ECCC), 2(056), 1995.
13. Nicolas Gürel. Extracting bits from coordinates of a point of an elliptic curve. Cryptology ePrint Archive, Report 2005/324, 2005. http: //eprint.iacr.org/.
14. J. Kamp, A. Rao, S. Vadhan, and D. Zuckerman. Deterministic extractors for small-space sources. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 691-700, New York, NY, USA, 2006. ACM Press.
15. J. Kamp and D. Zuckerman. Deterministic extractors for bitfixing sources and exposure-resilient cryptography. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
16. Oscar Moreno and P. Vijay Kumar. Minimum distance bounds for cyclic codes and deligne's theorem. IEEE Transactions on Information Theory, 39(5): 1524-1534, 1993.
17. A. Rao. An exposition of bourgain's 2-source extractor. Technical Report TR07-034, ECCC, 2007.
18. W. M. Schmidt. Equations over Finite Fields: An Elementary Approach, volume 536. Springer-Verlag, Lecture Notes in Mathematics, 1976.
19. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4): 701-717, 1980.
20. I. R. Shafarevich. Basic algebraic geometry. Springer-Verlag New York, Inc., New York, NY, USA, 1994.
21. R. Shaltiel. How to get more mileage from randomness extractors. In CCC '06: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, pages 46- 60, Washington, DC, USA, 2006. IEEE Computer Society.
22. L. Trevisan and S. Vadhan. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, page 32, Washington, DC, USA, 2000. IEEE Computer Society.
23. T. Wooley. A note on simultaneous congruences. J. Number Theory, 58: 288-297, 1996.
24. R. Zippel. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, pages 216-226. Springer-Verlag, 1979.