Computing in the Jacobian of a hyperelliptic curve

Author:
David G. Cantor

Journal:
Math. Comp. **48** (1987), 95-101

MSC:
Primary 11Y16; Secondary 11G20, 14H25, 14H40

DOI:
https://doi.org/10.1090/S0025-5718-1987-0866101-0

MathSciNet review:
866101

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.

**[1]**Alfred V. Aho, John E. Hopcroft & Jeffrey D. Ullman,*The Design and Analysis of Computer Algorithms*, Addison-Wesley, Reading, Mass., 1974. MR**0413592 (54:1706)****[2]**D. V. Chudnovsky & G. V. Chudnovsky,*Sequences of Numbers Generated by Addition in Formal Groups and New Primality and Factorization Tests*, Research report RC 11262 (#50739), IBM Thomas J. Watson Research Center, Yorktown Heights, N. Y., 1985.**[3]**Serge Lang,*Introduction to Algebraic Geometry*, Interscience, New York, 1958. MR**0100591 (20:7021)****[4]**H. W. Lenstra, Jr., "Factorization using elliptic curves." (To be published.)**[5]**Peter Montgomery, "Speeding the Pollard and elliptic curve methods of factorization,"*Math. Comp.*, v. 48, 1977, pp. 243-264. MR**866113 (88e:11130)****[6]**David Mumford,*Tata Lectures on Theta II*, Birkhäuser, Boston, 1984, ISBN 0-8176-3110-0. MR**742776 (86b:14017)****[7]**C. P. Schnorr & H. W. Lenstra, Jr., "A Monte Carlo factoring algorithm with linear storage,"*Math. Comp.*, v. 43, 1984, pp. 289-311. MR**744939 (85d:11106)****[8]**Martin Seysen, "A probabilistic factorization algorithm with quadratic forms of negative discriminant,"*Math. Comp.*(To appear.) MR**878705 (88d:11129)****[9]**Daniel Shanks,*Class Number, A Theory of Factorization, and Genera*, Proc. Sympos. Pure Math., vol. 20, Amer. Math. Soc., Providence, R. I., 1971, pp. 415-440. MR**0316385 (47:4932)****[10]**H. C. Williams, G. W. Dueck & B. K. Schmid, "A rapid method of evaluating the regulator and class number of a pure cubic field,"*Math. Comp.*, v. 41, 1983, pp. 235-286. MR**701638 (84m:12010)**

Retrieve articles in *Mathematics of Computation*
with MSC:
11Y16,
11G20,
14H25,
14H40

Retrieve articles in all journals with MSC: 11Y16, 11G20, 14H25, 14H40

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1987-0866101-0

Article copyright:
© Copyright 1987
American Mathematical Society