Computing in the Jacobian of a Hyperelliptic Curve
Open Access
- 1 January 1987
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 48 (177) , 95-101
- https://doi.org/10.2307/2007876
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 g is very large.Keywords
This publication has 7 references indexed in Scilit:
- Tata Lectures on Theta IIPublished by Springer Nature ,2007
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative DiscriminantMathematics of Computation, 1987
- Speeding the Pollard and Elliptic Curve Methods of FactorizationMathematics of Computation, 1987
- A Monte Carlo Factoring Algorithm With Linear StorageMathematics of Computation, 1984
- A Rapid Method of Evaluating the Regulator and Class Number of a Pure Cubic FieldMathematics of Computation, 1983
- Class number, a theory of factorization, and generaPublished by American Mathematical Society (AMS) ,1971
- Introduction to Algebraic Geometry.The American Mathematical Monthly, 1960