Skip to Main content Skip to Navigation
Journal articles

The arithmetic of Jacobian groups of superelliptic cubics

Abdolali Basiri 1, 2 Andreas Enge 3, 4 Jean-Charles Faugère 1, 2 Nicolas Gürel 3, 4
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Andreas Enge <>
Submitted on : Friday, October 30, 2009 - 6:07:10 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Wednesday, September 22, 2010 - 1:45:59 PM


Publisher files allowed on an open archive


  • HAL Id : inria-00071967, version 2


Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel. The arithmetic of Jacobian groups of superelliptic cubics. Mathematics of Computation, American Mathematical Society, 2005, 74 (249), pp.389-410. ⟨inria-00071967v2⟩



Record views


Files downloads