Fast arithmetic on hyperelliptic curves via continued fraction expansions

  title={Fast arithmetic on hyperelliptic curves via continued fraction expansions},
  author={Michael J. Jacobson},
In this paper, we present a new algorithm for computing the reduced sum of two divisors of an arbitrary hyperelliptic curve. Our formulas and algorithms are generalizations of Shanks’s NUCOMP algorithm, which was suggested earlier for composing and reducing positive definite binary quadratic forms. Our formulation of NUCOMP is derived by approximating the irrational continued fraction expansion used to reduce a divisor by a rational continued fraction expansion, resulting in a relatively simple… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 14 references

Computational aspects of NUCOMP

M. J. Jacobson, Jr., A. J. van der Poorten
Proc. ANTS-V, Lect. Notes Comp. Sci • 2002
View 7 Excerpts
Highly Influenced

On Gauss and composition I, II

D. Shanks
In Proc. NATO ASI on Number Theory and Applications, • 1989
View 4 Excerpts
Highly Influenced

Computing in the Jacobian of a hyperelliptic

D. G. Cantor
curve, Math. Comp • 1987
View 6 Excerpts
Highly Influenced

NTL: A library for doing number theory

V. Shoup
View 2 Excerpts
Highly Influenced

Algebraic Number Theory, Springer, Berlin

H. Hasse
View 2 Excerpts

Number Theory in Function

M. Rosen
View 3 Excerpts

How to distinguish hyperelliptic curves in even characteristic

A. Enge
Public-Key Cryptography and Computational Number Theory. De Gruyter (Berlin), • 2001
View 2 Excerpts

Similar Papers

Loading similar papers…