BIT Numerical Mathematics

, Volume 15, Issue 3, pp 331–334 | Cite as

A monte carlo method for factorization

  • J. M. Pollard
Scientific Notes


We describe briefly a novel factorization method involving probabilistic ideas.


Computational Mathematic Probabilistic Idea Factorization Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    J. M. Pollard,Theorems on Factorization and Primality Testing, Proc. Camb. Phil. Soc. 76 (1974), 521–528.Google Scholar
  3. 3.
    D. E. Knuth,Seminumerical Algorithms: the Art of Computer Programming, Vol. 2, Addison-Wesley, 1969.Google Scholar
  4. 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

Copyright information

© BIT Foundations 1975

Authors and Affiliations

  • J. M. Pollard
    • 1
  1. 1.Mathematics DepartmentPlessey Telecommunications ResearchMaidenheadEngland

Personalised recommendations