Re: Factorization: a new algorithm??

From: David Wagner (daw_at_taverner.cs.berkeley.edu)
Date: 03/28/04 

Date: Sun, 28 Mar 2004 04:17:14 +0000 (UTC)

boufarik wrote:
>at this point we check the right hand side (rhs) to see if it is a perfect
>square ( psq ). If it is, we have just factorized N=p*q [...]
>If the rhs is not a perfect square, then we [try again...]

Ahh, yes, you've found yet another exponential time factoring algorithm.
Not very interesting. Modern factoring algorithms are much, much faster.

If you don't believe me, try and use your method to factor one of the RSA
challenge numbers. You'll see.