Deformation Theory and The Computation of Zeta Functions

We present a new approach to the problem of computing the zeta function of a hypersurface over a finite field. For a hypersurface defined by a polynomial of degree d in n variables over the field of q elements, one desires an algorithm whose running time is a polynomial function of dn log(q). (Here we assume d ⩾ 2, for otherwise the problem is easy.) The case n = 1 is related to univariate polynomial factorisation and is comparatively straightforward. When n = 2 one is counting points on curves, and the method of Schoof and Pila yields a complexity of log⁡(q)Cd , where the function Cd depends exponentially on d. For arbitrary n, the theorem of the author and Wan gives a complexity which is a polynomial function of (pdn log(q))n, where p is the characteristic of the field. A complexity estimate of this form can also be achieved for smooth hypersurfaces using the method of Kedlaya, although this has only been worked out in full for curves. The new approach we present should yield a complexity which is a small polynomial function of pdn log(q). In this paper, we work this out in full for Artin–Schreier hypersurfaces defined by equations of the form Zp − Z = f, where the polynomial f has a diagonal leading form. The method utilises a relative p‐adic cohomology theory for families of hypersurfaces, due in essence to Dwork. As a corollary of our main theorem, we obtain the following curious result. Let f be a multivariate polynomial with integer coefficients whose leading form is diagonal. There exists an explicit deterministic algorithm which takes as input a prime p, outputs the number of solutions to the congruence equation f = 0 op, and runs in {\mathcal O}(p^{2 + \varepsilon}) bit operations, for any ε > 0. This improves upon the elementary estimate of {\mathcal O}(p^{n‐1 + \varepsilon}) bit operations, where n is the number of variables, which can be achieved using Berlekamp's root counting algorithm. 2000 Mathematics Subject Classification 11Y99, 11M38, 11T99.

[1]  Bernard Dwork,et al.  On the Rationality of the Zeta Function of an Algebraic Variety , 1960 .

[2]  Bernard Dwork,et al.  On the zeta function of a hypersurface , 1962 .

[3]  Bernard Dwork,et al.  On the Zeta Function of a Hypersurface: III , 1964 .

[4]  D. N. Clark A note on the $p$-adic convergence of solutions of linear differential equations , 1966 .

[5]  B. Dwork Normalized Period Matrices I: Plane Curves , 1971 .

[6]  P. Deligne,et al.  La Conjecture de Weil. II , 1980 .

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

[8]  Steven Sperber,et al.  ON THE p-ADIC THEORY OF EXPONENTIAL SUMS , 1986 .

[9]  H. Cohen A course in computational number theory , 1993 .

[10]  Bjorn Poonen,et al.  Computational Aspects of Curves of Genus at Least 2 , 1996, ANTS.

[11]  Leonard M. Adleman,et al.  Counting Rational Points on Curves and Abelian Varieties over Finite Fields , 1996, ANTS.

[12]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[13]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[14]  Sheldon Katz,et al.  Mirror symmetry and algebraic geometry , 1999 .

[15]  Daqing Wan,et al.  Dwork’s conjecture on unit root zeta functions , 1999, math/9911270.

[16]  Robert Harley,et al.  Counting Points on Hyperelliptic Curves over Finite Fields , 2000, ANTS.

[17]  R. Harley,et al.  An extension of Satoh's algorithm and its implementation , 2000 .

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

[19]  Nicolas Gürel,et al.  An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves , 2001, ASIACRYPT.

[20]  Joos Vandewalle,et al.  A Memory Efficient Version of Satoh's Algorithm , 2001, EUROCRYPT.

[21]  Frederik Vercauteren,et al.  An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2 , 2002, ANTS.

[22]  Frederik Vercauteren,et al.  Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2 , 2002, CRYPTO.

[23]  Takakazu Satoh,et al.  On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields , 2002, ANTS.

[24]  Alan G. B. Lauder,et al.  Computing zeta functions of Artin-Schreier curves over finite fields , 2002 .

[25]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[26]  Alan G. B. Lauder,et al.  Computing Zeta Functions of Kummer Curves via Multiplicative Characters , 2003, Found. Comput. Math..

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

[28]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

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