Modern Factorization Methods
Hans Riesel · Birkhäuser Boston eBooks · 2011
The art of decomposing large integers into prime factors has advanced considerably during the last 25 years. It is the advent of high-speed computers that has rekindled interest in this field. This development has followed several lines. In one of these, already existing theoretical methods and known algorithms have been carefully analyzed and perfected. As an example of this work we mention Michael Morrison’s and John Brillhart’s analysis of an old factorization method, the continued fraction algorithm, going back to ideas introduced already by Legendre and developed further by Maurice Kraïtchik, D. H. Lehmer and R. E. Powers. 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.