An Experimental Study of Monte Carlo Factoring Techniques

William Hartman · 1982

Pollard (1975) describes a "Monte Carlo" factoring algorithm based on iterating some specific quadratic polynomials.In this paper different polynomials are tested in the algorithm to see if a more efficient factoring can be obtained.The results are inconclusive.

Read the paper · More papers on PaperTik