Arithmetic on superelliptic curves

This paper is concerned with algorithms for computing in the divisor class group of a nonsingular plane curve of the form yn = c(x) which has only one point at infinity. Divisors are represented as ideals, and an ideal reduction algorithm based on lattice reduction is given. We obtain a unique representative for each divisor class and the algorithms for addition and reduction of divisors run in polynomial time. An algorithm is also given for solving the discrete logarithm problem when the curve is defined over a finite field.

[1]  Sachar Paulus.  An Algorithm of Subexponential Type Computing the Class Group of Quadratic Orders over Principal Ideal Domains , 1996, ANTS.

[2]  Renate Scheidler.  Ideal arithmetic and infrastructure in purely cubic function fields , 2001 .

[3]  D. Cantor.  Computing in the Jacobian of a hyperelliptic curve , 1987 .

[4]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[5]  Andreas Stein,et al.  Voronoi's algorithm in purely cubic congruence function fields of unit rank 1 , 2000, Math. Comput..

[6]  Michael E. Pohst,et al.  On Integral Basis Reduction in Global Function Fields , 1996, ANTS.

[7]  Andreas Stein,et al.  Key-Exchange in Real Quadratic Congruence Function Fields , 1996, Des. Codes Cryptogr..

[8]  Nigel P. Smart,et al.  Experiments Using an Analogue of the Number Field Sieve Algorithm to Solve the Discrete Logarithm Problem in the Jacobians of Hyperelliptic Curves , 1997 .

[9]  C. Pomerance,et al.  Rigorous discrete logarithm computations in finite fields via smooth polynomials , 1997 .

[10]  C. Hoffmann.  Algebraic curves , 1988 .

[11]  Leonard M. Adleman,et al.  A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields , 1994, ANTS.

[12]  Ming-Deh A. Huang,et al.  Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve , 1994, J. Symb. Comput..

[13]  Emil J. Volcheck.  Computing in the jacobian of a plane algebraic curve , 1994, ANTS.

[14]  Sachar Paulus,et al.  Lattice Basis Reduction in Function Fields , 1998, ANTS.

[15]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[16]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[17]  J. Coates,et al.  Construction of rational functions on a curve , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.

[18]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[19]  Sachar Paulus,et al.  Real and imaginary quadratic representations of hyperelliptic function fields , 1999, Math. Comput..

[20]  Andreas Stein,et al.  Computing discrete logarithms in real quadratic congruence function fields of large genus , 1999, Math. Comput..

[21]  K. Mahler,et al.  An Analogue to Minkowski's Geometry of Numbers in a Field of Series , 1941 .

[22]  Jean-Pierre Cherdieu,et al.  Efficient Reduction on the Jacobian Variety of Picard Curves , 2000 .