Re: Yet Another Factoring Algorithm (yafa)

Phil Carmody wrote:

Marc Bogaerts <mbg.DELSPAMnimda@xxxxxxxxx> writes:
I would like to have comments on the following algorithm.

It's 1-stage Pollard P-1 made slightly less efficient.

Indeed, I went looking for the working of the Pollard algorithm and you are
indeed right. The loss of efficiency is due to the clumsy way the notion of
B-powersmoothness was taken care of. That primes occur in certain powers >1
in the factorization of phi(n) is a natural thing, and assuming this is
much more likely for small primes is also a natural thing, but restarting
the series of primes as exponents in the algorithm at arbitrary moments
does, after all, not seem to be the good thing to do.


.

Relevant Pages

  • Re: Yet Another Factoring Algorithm (yafa)
    ... It's 1-stage Pollard P-1 made slightly less efficient. ... I went looking for the working of the Pollard algorithm and you are ... That primes occur in certain powers>1 ... just that, small lookup tables, and so there's little efficiency ...
    (sci.math)
  • Re: Yet Another Factoring Algorithm (yafa)
    ... It's 1-stage Pollard P-1 made slightly less efficient. ... I went looking for the working of the Pollard algorithm and you ... The loss of efficiency is due to the clumsy way the ... assuming this is much more likely for small primes is also a natural ...
    (sci.math)