Computer Generation of Explicit Formulas for Hyperelliptic Curve Divisor Arithmetic
Published in Lecture Notes in Computer Science, 2026
Abstract
The Jacobian of a hyperelliptic curve is the subject of many conjectures and open problems in algebraic geometry and number theory. Efficient Jacobian arithmetic plays a crucial role in the experimental investigation of these problems. For curves of low genus, explicit formulas effectively realize this arithmetic, but manually developing such formulas is not feasible in higher genera. We introduce the first software package for automating the process of generating and verifying explicit formulas for curves of arbitrary genus. Our formulas outperform generic algorithms for Jacobian arithmetic and exhibit comparable operation counts against manually fine-tuned formulas for small genera.
Recommended citation: Asgari, A.A., He, H., Jacobson, M.J., Scheidler, R. (2027). Computer Generation of Explicit Formulas for Hyperelliptic Curve Divisor Arithmetic. In: Boulier, F., Mou, C., Sadykov, T.M., Uncu, A.K. (eds) Computer Algebra in Scientific Computing. CASC 2026. Lecture Notes in Computer Science, vol 16844. Springer, Cham.
Download Paper | Download Bibtex