Asymptotically fast factorization of integers

Mathematics of Computation

Volumn 36, Issue 153, 1981, Pages 255-260

  Dixon, John D ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966249438     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1981-0595059-1     Document Type: Article

References (13)

1. N. G. de Bruitn, "On the number of positive integers x and free of prime factors y. II," Indag. Math., v. 28, 1966, p 239-247.
2. G. J. Chaitin, J. T. Schwartz, "A note on Monte Carlo primality tests and algorithmic information theory," Comm. Pure Appl. Math., v. 31, 1978, p. 521-527.
3. W. Feller, Probability Theory and its Applications. Vol. 1, Wiley, New York, 1950.
4. H. Halberstam, "On integers all of whose prime factors are small," Proc. London Math. Soc., (3), v. 21, 1970, p. 102-107.
5. D. Knuth, The Art of Computer Programming. Vol. 2, Addison-Wesley, New York, 1971.
6. R. S. Lehman, "Factoring large integers," Math. Comp., v. 28, 1974, p. 637-646.
7. G. L. Miller, "Riemann's hypothesis and tests for primality," J. Comput. System Sci., v. 13, 1976, p. 300-317.
8. J. M. Pollard, "Theorems on factorization and primality testing," Proc. Cambridge Philos. Soc., v. 76, 1974, p. 521-528.
9. M. O. Rabin, "Probabilistic algorithms," Algorithms and Complexity-New Directions and Recent Results (J. F. Traub, Ed.), Academic Press, New York, 1976.
10. R. L. Rtvest, A. Shamir, L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Comm. ACM, v. 21, 1978, p. 120-128.
11. D. Shanks, Class Number, a Theory of Factorization, and Genera, Proc. Sympos. Pure Math. Amer. Math. Soc, Providence, R. I., vol. 20, 1970, p. 415-440.
12. R. Solovay, V. Strassen, "A fast Monte-Carlo test for primality," SIAM J. Comput., v. 6, 1977, p. 84-85.
13. I. M. Vinogradov, Elements of Number Theory, 5th rev. ed., Dover, New York, 1954.