Counting points on curves using a map to P1, II

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds, analyse the complexity of the algorithm and provide some examples computed with our implementation.

[1]  Andrew V. Sutherland.  Constructing elliptic curves over finite fields with prescribed torsion , 2012, Math. Comput..

[2]  M. V. Hoeij,et al.  Gonality of the modular curve X1(N) , 2013, 1307.5719.

[3]  Yifan Yang,et al.  Defining equations of modular curves , 2006 .

[4]  Hendrik Hubrechts,et al.  Fast arithmetic in unramified p-adic fields , 2009, Finite Fields Their Appl..

[5]  David Harvey,et al.  Kedlaya's Algorithm in Larger Characteristic , 2006 .

[6]  Mark van Hoeij,et al.  An Algorithm for Computing an Integral Basis in an Algebraic Function Field , 1994, J. Symb. Comput..

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

[8]  Jens-Dietrich Bauch.  Computation of Integral Bases , 2015, 1507.04058.

[9]  A. Storjohann.  Algorithms for matrix canonical forms , 2000 .

[10]  Ruud Pellikaan,et al.  The Newton Polygon of Plane Curves with Many Rational Points , 2000, Des. Codes Cryptogr..

[11]  Kiran S. Kedlaya.  Search techniques for root-unitary polynomials , 2006 .

[12]  Jan Tuitman,et al.  Improvements to the Deformation Method for Counting Points on Smooth Projective Hypersurfaces , 2013, Found. Comput. Math..

[13]  Frederik Vercauteren,et al.  Counting points on Cab curves using Monsky-Washnitzer cohomology , 2006, Finite Fields Their Appl..

[14]  Jan Tuitman,et al.  Counting points on curves using a map to P1 , 2014, Math. Comput..

[15]  Frederik Vercauteren,et al.  An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2 , 2004, Journal of Cryptology.

[16]  Jennifer S. Balakrishnan.  Iterated Coleman integration for hyperelliptic curves , 2013 .

[17]  K. Kedlaya.  Effective p-adic cohomology for cyclic cubic threefolds , 2008 .

[18]  William Fulton,et al.  Hurwitz Schemes and Irreducibility of Moduli of Algebraic Curves , 1969 .

[19]  Peter Bruin.  Modular curves, Arakelov theory, algorithmic applications , 2010 .

[20]  Florian Hess,et al.  Computing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics , 2002, J. Symb. Comput..

[21]  Wouter Castryck,et al.  Computing Zeta Functions of Nondegenerate Curves , 2006, IACR Cryptol. ePrint Arch..

[22]  Alan G. B. Lauder.  A Recursive Method for Computing Zeta Functions of Varieties , 2006, math/0602352.

[23]  K. Kedlaya,et al.  Effective convergence bounds for Frobenius structures on connections , 2011, 1111.0136.

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

[25]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[26]  Robert W. Bradshaw,et al.  Explicit Coleman Integration for Hyperelliptic Curves , 2010, ANTS.

[27]  David Harvey,et al.  Counting points on hyperelliptic curves in average polynomial time , 2012, 1210.8239.

[28]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.