Computing in the Jacobian of a hyperelliptic curve

Abstract

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 <italic>g</italic> is very large.