Hi Jasen! :-)

 JB> RSA public keys P can be representes as a procuvct of primes A*B=P
 JB> (the private key is the two numbers A and B)
[...]
 JB> I was planning on trying squares G   in P-G until I got a square 
 JB> result
 JB> for G-P  then I'd have  C=G and D=G-P  and from that determine A and 
 JB> B
I don't think that checking a sequence of numbers for being a square is
faster than just trying all A*B combinations. ;)

Ciao
Pascal

--- Msged/LNX 6.1.1