Skip to main content
SpringerLink
Log in

A monte carlo method for factorization

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We describe briefly a novel factorization method involving probabilistic ideas.

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. M. C. Wunderlich and J. L. Selfridge,A Design for a Number Theory Package with an Optimized Trial Division Routine, Comm. A.C.M. 17,5 (May 1974), 272–276.

    Google Scholar 

  2. J. M. Pollard,Theorems on Factorization and Primality Testing, Proc. Camb. Phil. Soc. 76 (1974), 521–528.

    Google Scholar 

  3. D. E. Knuth,Seminumerical Algorithms: the Art of Computer Programming, Vol. 2, Addison-Wesley, 1969.

  4. Michael A. Morrison and John Brillhart,A Method of Factoring and the Factorization of F 7, Math. Comp. 29,129 (1975), 183–206.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Plessey Telecommunications Research, Taplow Court, Taplow, Maidenhead, Berkshire, England

    J. M. Pollard

Authors
  1. J. M. Pollard
    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

Pollard, J.M. A monte carlo method for factorization. BIT 15, 331–334 (1975). https://doi.org/10.1007/BF01933667

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation