Hi Pascal.

31-Mar-04 16:18:20, Pascal Schmidt wrote to Jasen Betts


 PS> Hi Jasen! :-)

 PS>>> Thus, no integer ending in 2, 3, 7, or 8 can be the square of
 PS>>> any other integer. This reduces the problem space by 40%. ;)
 JB>> hmm, to do that I'd need to divide by 10...
 PS> Well, you didn't say anything about the representation of your
 PS> bignums. ;)

 PS> [...]
 JB>> but it seems though that the more terminal bits I examine the
 JB>> less cost-effective it becomes.

 PS> I don't think there's a good heuristic besides really doing a
 PS> square root, but doing an approximation can be costly on bignums

Darn...


RSA public keys P can be representes as a procuvct of primes A*B=P
(the private key is the two numbers A and B)

                 2               2
  let C=((A+B)/2) and D=((A-B)/2)

 P=A*B= C-D

I was planning on trying squares G   in P-G until I got a square result
for G-P  then I'd have  C=G and D=G-P  and from that determine A and B

 -=> Bye <=-

---