This paper is concerned with algorithms for computing in the divisor class group of a nonsingular plane curve of the form $y^n = 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.
|Translated title of the contribution||Arithmetic on superelliptic curves|
|Pages (from-to)||393 - 405|
|Number of pages||12|
|Journal||Mathematics of Computation|
|Publication status||Published - Jan 2001|