BIT Numerical Mathematics

, Volume 20, Issue 2, pp 176–184

An improved Monte Carlo factorization algorithm

  • Richard P. Brent
Part II Numerical Mathematics

Abstract

Pollard's Monte Carlo factorization algorithm usually finds a factor of a composite integerN inO(N1/4) arithmetic operations. The algorithm is based on a cycle-finding algorithm of Floyd. We describe a cycle-finding algorithm which is about 36 percent faster than Floyd's (on the average), and apply it to give a Monte Carlo factorization algorithm which is similar to Pollard's but about 24 percent faster.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BIT Foundations 1980

Authors and Affiliations

  • Richard P. Brent
    • 1
  1. 1.Department of Computer ScienceAustralian National UniversityCanberraAustralia

Personalised recommendations