Skip to main content
SpringerLink
Log in

Factoring on a Computer

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. M. Adelman, C. Pomerance and R. S. Rumely (1983) On distinguishing prime numbers from composite numbers,Annals of Mathematics 117, 173–206.

    Article  MathSciNet  Google Scholar 

  2. A. H. Beiler (1964)Recreations in the Theory of Numbers—the Queenof Mathematics Entertains, New York: Dover.

    Google Scholar 

  3. R. P. Brent and J. H. Pollard (1981) Factorization of the eighth Fermat number,Math. Comp. 36, 627–630.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman and S. S. Wagstaff, Jr.,Factorizations of b“ ±1 up to high powers, to be published by the Amer. Math. Soc.

  5. J. Brillhart (1981) Fermat’s factoring method and its variants,Congressus Numerantium 32, 29–48.

    MathSciNet  Google Scholar 

  6. H. Cohen and H. W. Lenstra Jr., Primality testing and Jacobi sums,Math. Comp., to appear. 7. J. D. Dixon, Factorization and primality tests,Amer. Math. Monthly, to appear.

  7. J. L. Gerver, Factoring large numbers with a quadratic sieve,Math. Comp., to appear.

  8. R. K. Guy (1975) How to factor a number,Proc. 5th Manitoba Conf. on Numerical Math., pp. 49–89.

  9. D. E. Knuth (1981)The Art of Computer Programming, Vol. 2Semi numerical Algorithms, 2nd Edition, Reading, Mass.: Addison Wesley.

    MATH  Google Scholar 

  10. D. N. Lehmer (1932-1933) Hunting big game in the theory of numbers,Scripta Math. 1, 229–235.

    Google Scholar 

  11. L. Monier (1980)Algorithmes de factorisation d’entiers, Thèse de 3me cycle, Orsay.

  12. M. A. Morrison and J. Brillhart (1975) A method of factoring and the factorization of F7.Math. Comp. 29, 183–205.

    MATH  MathSciNet  Google Scholar 

  13. D. Parkinson and M. C. Wunderlich, A memory efficient algorithm for Gaussian elimination over GF(2) on parallel computers, in preparation.

  14. J. M. Pollard (1974) Theorems on factorization and primality testing,Proc. Camb. Philos. Soc. 76, 521–528.

    Article  MATH  MathSciNet  Google Scholar 

  15. J. M. Pollard (1975) A Monte Carlo method for factorization,BIT 15, 331–334.

    Article  MATH  MathSciNet  Google Scholar 

  16. C. Pomerance (1981) Recent developments in primality testing,Math. Intelligencer 3, 97–105.

    Article  MATH  MathSciNet  Google Scholar 

  17. C. Pomerance, Analysis and comparison of some integer factoring algorithms,Number Theory and Computers (H. W. Lenstra Jr., and R. Tijdeman, eds.), Math. Centrum Tracts, Number 154, Part I and Number 155, Part II, Amsterdam, 1983.

  18. C. Pomerance and S. S. Wagstaff Jr. (1982) Implementation of the continued fraction integer factoring algorithm,Proc. 12th Winnipeg Conf. on Numerical methods and computing, to appear.

  19. G. J. Simmons (ed.) (1982)Secure communications and asymmetric cryptosystems, AAAS selected symposium 69, Boulder.

  20. J. W. Smith and S. S. Wagstaff Jr., How to crack an RSA cryptosystem,Congressus Numerantium, to appear.

  21. H. C. Williams (1978) Primality testing on a computer,Ars Combinatoria 5, 127–185.

    MATH  MathSciNet  Google Scholar 

  22. H. C. Williams (1982) A p + 1 method of factoring,Math. Comp. 39, 225–234.

    MATH  MathSciNet  Google Scholar 

  23. M. C. Wunderlich and J. L. Selfridge (1974) A design for a number theory package with an optimized trail division routine,Comm. ACM 17, 272–276.

    Article  MATH  Google Scholar 

  24. M. C. Wunderlich, Implementing the continued fraction factoring algorithm on parallel machines, unpublished manuscript.

  25. M. C. Wunderlich, Recent advances in the design and implementation of large integer factorization algorithms, unpublished manuscript.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T2N2, Winnipeg, Manitoba, Canada

    H. C. Williams

Authors
  1. H. C. Williams
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Williams, H.C. Factoring on a Computer. The Mathematical Intelligencer 6, 29–37 (1984). https://doi.org/10.1007/BF03024126

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03024126

Keywords

Search

Navigation