William J. Hartman
Abstract: 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.
Keywords: Monte Carlo factoring
To request a reprint of this report, contact:
Lilli Segre, Publications Officer
Institute for Telecommunication Sciences
Disclaimer: Certain commercial equipment, components, and software may be identified in this report to specify adequately the technical aspects of the reported results. In no case does such identification imply recommendation or endorsement by the National Telecommunications and Information Administration, nor does it imply that the equipment or software identified is necessarily the best available for the particular application or uses.
Back to Search Results