The expectation of success using a monte carlo factoring method some statistics on quadratic class numbers

Mathematics of Computation

Volumn 43, Issue 167, 1984, Pages 313-327

  Buell, Duncan A ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966221517     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1984-0744940-1     Document Type: Article

References (9)

1. John Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman, S. S. Wagstaff., Factorizations of b1, b = 2, 3, 5, 6, 7, 10, 11, 12, up to High Powers, Contemporary Math., Amer. Math. Soc, Providence, R. I., Vol. 22 1983.
2. Duncan A. Buell, "Class groups of quadratic fields, " Math. Comp., v. 30, 1976, p. 610-623.
3. Donald Knuth, The Art of Computer Programming, 2nd ed., Addison-Wesley, Reading, Mass., 1981, Vol. 2 p. 323.
4. Alexander M. Mood, Franklin A. Graybill, Introduction to the Theory of Statistics, McGraw-Hill, New York, 1963, p. 126-129.
5. Carl Pomerance, "Analysis and comparison of some integer factoring methods, " Computational Methods in Number Theory (H. W. Lenstra, Jr, R. Tijdeman, eds) Math Centrum, Amsterdam, 1982.
6. Carl Pomerance, Samuel S. Wagstaff., "Implementation of the continued fraction integer factoring algorithm." (To appear.)
7. C. P. Schnorr, H. W. Lenstra., "A Monte Carlo factoring algorithm with finite storage." Extended abstract appears in Lecture Notes in Comput. Sci., Springer-Verlag, New York, Vol. 145 p. 19-34.
8. Daniel Shanks, Class Number, A Theory of Factorization, and Genera, Proc. Sympos. Pure Math, Amer. Math. Soc, Providence, R. I., 1971. Vol. 20 p. 415-440.
9. H. G. Zimmer, Computational Problems, Methods, and Results in Algebraic Number Theory, Lecture Notes in Math, Springer-Verlag, New York, Vol. 262, 1972.