Computing in the jacobian of a hyperelliptic curve

Mathematics of Computation

Volumn 48, Issue 177, 1987, Pages 95-101

  Cantor, David G ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968494137     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1987-0866101-0     Document Type: Article

References (8)

1. Alfred V. Aho, John E. Hopcroft Jeffrey D. Ui.lman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass., 1974.
2. D. V. Chudnovsky G. V. Chudnovsky, Sequences of Numbers Generated by Addition in Formal Groups and New Primaltty and Factorization Tests. Research report RC 11262 (#50739). IBM Thomas J. Watson Research Center, Yorktown Heights, N. Y., 1985. Serge Lang, Introduction to Algebraic Geometry, Interscience, New York, 1958.
3. H. W. Lenstra, "Factorization using elliptic curves." (To be published.)
4. Peter Montgomery, "Speeding the Pollard and elliptic curve methods of factorization," Math. Comp., v. 48, 1977, p. 243-264.
5. C. P. Schnorr p H. W. Lenstra, "A Monte Carlo factoring algorithm with linear storage," Math. Comp., v. 43, 1984, pp. 289-311.
6. Martin Seysen, "A probabilistic factorization algorithm with quadratic forms of negative discriminant," Math. Comp. (To appear.)
7. Daniel Shanks, Class Number, A Theory of Factorization, and Genera, Proc. Sympos. Pure Math., vol. 20, Amer. Math. Soc, Providence, R. I., 1971, p. 415-440.
8. 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, p. 235-286.