Skip to main content
SpringerLink
Log in

Factoring: Algorithms, computations, and computers

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This article discusses the computational structure of the most effective methods for factoring integers and the computer architectures—existing and used, proposed, and under construction—which efficiently perform the computations of these various methods. New developments in technology and in pricing of computers are making it possible to build powerful parallel machines, at relatively low cost, which can substantially outperform standard computers on specific types of computations. The intent of this article is to use factoring and computers for factoring to provoke general thought about this matching of computer architectures to algorithms and computations.

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

Similar content being viewed by others

References

  1. Borevich, Z. I., and Shafarevich, I. R. 1966. Number Theory. Academic Press, New York, pp. 342–343.

    Google Scholar 

  2. Brillhart, J., Lehmer, D. H., Selfridge, J. L., Tuckerman, B., and Wagstaff, S. S. Jr. 1983. Factorizations of b n ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12, up to High Powers, American Mathematical Society, Providence, R. I.

    Google Scholar 

  3. Buell, D. A. 1977. Small class numbers and extreme values of L-functions of quadratic fields. Mathematics of Computation, 31, 786–796.

    Google Scholar 

  4. Chiarulli, D. M., Rudd, W. G., and Buell, D. A. 1985. DRAFT—A dynamically reconfigurable processor for integer arithmetic. Proceedings, 7th International Symposium on Computer Arithmetic, Urbana, IL, pp. 309–317.

  5. Davis, J. A., and Holdridge, Diane B. 1984. Factorization using the quadratic sieve algorithm. In Advances in Cryptology (David Chaum, ed), Plenum Press, New York, pp. 103–113.

    Google Scholar 

  6. Davis, J. A., and Holdridge, Diane B. 1984. Most wanted factorizations using the quadratic sieve. Sandia Technical Report SAND84-1658 UC-32 (August).

  7. Dixon, J. D. 1984. Factorization and primality tests. American Mathematical Monthly, 91, 333–352.

    Google Scholar 

  8. Gerver, J. L. 1983. Factoring large numbers with a quadratic sieve. Mathematics of Computation, 41, 287–294.

    Google Scholar 

  9. Guy, R. K. 1976, How to factor a number.Congressus Numerantium, 16, 49–89.

    Google Scholar 

  10. Hecke, E. 1970. Algebraische Zahlen, Chelsea, New York, pp. 210–217.

    Google Scholar 

  11. Knuth, D. E. 1981. The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA, pp. 441ff.

  12. Lenstra, H. W. Jr., informal communication.

  13. Montgomery, P. 1985. Modular multiplication without division. Mathematics of Computation, 44, pp. 519–521.

    Google Scholar 

  14. Montgomery, P., letter dated March 22, 1985.

  15. Morrison, M. A., and Brillhart, J. 1971. The factorization of F 7. Bulletin of the AMS, 77, 264.

    Google Scholar 

  16. Morrison, M. A., and Brillhart, J. 1975. A method of factoring and the factorization of F 7. Mathematics of Computation, 29, 183–205.

    Google Scholar 

  17. Pollard, J. M. 1974. Theorems on factoring and primality testing. Proceedings of the Cambridge Philosophical Society, 76, 521–528.

    Google Scholar 

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

    Google Scholar 

  19. Pomerance, C. 1983. Analysis and comparison of some integer factoring algorithms. In Computational Methods in Number Theory (H. W. Lenstra Jr., and R. Tijdeman, eds.), Math. Centrum, Amsterdam, pp. 89–139.

    Google Scholar 

  20. Pomerance, C., and Wagstaff, S. S. Jr. 1983. Implementation of the continued fraction integer factoring algorithm. Congressus Numerantium, 37, 99–118.

    Google Scholar 

  21. Pomerance, C., Smith, J. W., and Wagstaff, S. S. Jr. 1984. New ideas for factoring large integers. Advances in Cryptology (David Chaum, ed.), Plenum Press, New York, pp. 81–86.

    Google Scholar 

  22. Rudd, W. G., Chiarulli, D. M., and Buell, D. A. 1984. A high performance factoring machine. Proceedings of the 11th International Symposium on Computer Architecture, Ann Arbor, pp. 297–300.

  23. Schnorr, C. P., and Lenstra, H. W. Jr. 1984. A Monte Carlo factoring algorithm with linear storage. Mathematics of Computation, 43, 289–312.

    Google Scholar 

  24. Seitz, C. L. 1985. The cosmic cube. Communications of the ACM, 28, 22–33.

    Google Scholar 

  25. Shanks, D. 1969. Class number, a theory of factorization, and genera. Proc. Symp. in Pure Maths., vol. 20, American Mathematical Society, Providence, R. I., pp. 415–440.

    Google Scholar 

  26. Silverman, R. D. 1987. The multiple polynomial quadratic sieve, to appear.

  27. Smith, J. W., and Wagstaff, S. S., Jr. 1983. An extended precision operand computer. Proceedings of the 21st Southeast Region ACM Conference, pp. 209–216.

  28. Tate, J. 1974. The arithmetic of elliptic curves. Inventiones mathematicae, 23, 179–206.

    Google Scholar 

  29. Wagstaff, S. S., Jr. Updates to the Cunningham Table, informal communications.

  30. Wiedemann, D. 1986. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, IT-32, 54–62.

    Google Scholar 

  31. Williams, H. C. 1984. An overview of factoring. In Advances in Cryptology (David Chaum, ed.), Plenum Press, New York, pp. 71–80.

    Google Scholar 

  32. Williams, H. C. 1985. Continued fractions and number-theoretic computations. Rocky Mountain Journal of Mathematics, 15, 621–655.

    Google Scholar 

  33. Wunderlich, M. C. 1984. Factoring numbers on the Massively Parallel Processor. In Advances in Cryptology (David Chaum, ed.), Plenum Press, New York, pp. 87–102.

    Google Scholar 

  34. Wunderlich, M. C. 1985. Implementing the continued fraction factoring algorithm on parallel machines. Mathematics of Computation, 44, 251–260.

    Google Scholar 

  35. Zakharov, V. 1984. Parallelism and array processing. IEEE Transactions on Computers, C-33, 45–78.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Supercomputing Research Center, 4380 Forbes Boulevard, 20706, Lanham, Maryland, USA

    Duncan A. Buell

Authors
  1. Duncan A. Buell
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The author's research at Louisiana State University was supported in part by the National Science Foundation and the National Security Agency under grants NSF DCR 83-115-80 and NSA MDA904-85-H-0006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buell, D.A. Factoring: Algorithms, computations, and computers. J Supercomput 1, 191–216 (1987). https://doi.org/10.1007/BF00128046

Download citation

  • Issue Date:

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

Keywords

Search

Navigation