In this paper we present algorithms, suitable for computer use, for computation in the Jacobian of a hyperelliptic curve. We present a reduction algorithm which is asymptotically faster than that of Gauss when the genus g is very large.
No takes yet. Share an insight, caveat, or question.
David G. Cantor (1987) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: