The arithmetic of Jacobian groups of superelliptic cubics
Open Access
- 20 July 2004
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 74 (249) , 389-410
Abstract
We present two algorithms for the arithmetic of cubic curves with a totally ramified prime at infinity. The first algorithm, inspired by Cantor’s reduction for hyperelliptic curves, is easily implemented with a few lines of code, making use of a polynomial arithmetic package. We prove explicit reducedness criteria for superelliptic curves of genus 3 and 4, which show the correctness of the algorithm. The second approach, quite general in nature and applicable to further classes of curves, uses the FGLM algorithm for switching between Gröbner bases for different orderings. Carrying out the computations symbolically, we obtain explicit reduction formulae in terms of the input data.Keywords
This publication has 23 references indexed in Scilit:
- A general framework for subexponential discrete logarithm algorithmsActa Arithmetica, 2002
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential timeMathematics of Computation, 2001
- Ideal arithmetic and infrastructure in purely cubic function fieldsJournal de Théorie des Nombres de Bordeaux, 2001
- Arithmetic on superelliptic curvesMathematics of Computation, 2000
- Computing discrete logarithms in real quadratic congruence function fields of large genusMathematics of Computation, 1999
- Lattice basis reduction in function fields1998
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989
- Computing in the Jacobian of a Hyperelliptic CurveMathematics of Computation, 1987
- Sur les courbes algébriques et les variétés qui s’en déduisent (Introduction)1979