Detecting Rational Points on Hypersurfaces over Finite Fields

We study the complexity of deciding whether a given homogeneous multivariate polynomial has a non- trivial root over a finite field. Given a homogeneous algebraic circuit C that computes an n- variate polynomial p(x) of degree d over a finite field Fq, we wish to determine if there exists a nonzero xisinFq n with C(x)=0. For constant n there are known algorithms for doing this efficiently. However for linear n, the problem becomes NP hard. In this paper, using interesting algebraic techniques, we show that if d is prime and n>d/2, the problem can be solved over sufficiently large finite fields in randomized polynomial time. We complement this result by showing that relaxing any of these constraints makes the problem intractable again.

[1]  Ming-Deh A. Huang,et al.  Solving systems of polynomial congruences modulo a large prime , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  V. Shoup,et al.  Removing randomness from computational number theory , 1989 .

[3]  László Lovász,et al.  Singular spaces of matrices and their application in combinatorics , 1989 .

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

[5]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[6]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[7]  Leonard M. Adleman,et al.  Counting Points on Curves and Abelian Varieties Over Finite Fields , 2001, J. Symb. Comput..

[8]  Jeffrey Shallit,et al.  The Computational Complexity of Some Problems of Linear Algebra , 1996, J. Comput. Syst. Sci..

[9]  K. Kedlaya.  Counting Points on Hyperelliptic Curves using Monsky-Washnitzer Cohomology , 2001, math/0105031.

[10]  Erich Kaltofen,et al.  A polynomial-time reduction from bivariate to univariate integral polynomial factorization , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11]  Daqing Wan,et al.  Modular Counting of Rational Points over Finite Fields , 2008, Found. Comput. Math..

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

[13]  Alan G. B. Lauder.  Counting Solutions to Equations in Many Variables over Finite Fields , 2004, Found. Comput. Math..

[14]  Guillermo Matera,et al.  Improved explicit estimates on the number of solutions of equations over a finite field , 2006, Finite Fields Their Appl..

[15]  Alan G. B. Lauder,et al.  Counting points on varieties over finite fields of small characteristic , 2006, math/0612147.

[16]  H. Davenport.  Multiplicative Number Theory , 1967 .

[17]  J. Pila.  Frobenius maps of Abelian varieties and finding roots of unity in finite fields , 1990 .

[18]  Venkatesan Guruswami,et al.  Algorithms for Modular Counting of Roots of Multivariate Polynomials , 2006, Algorithmica.