Hi Pascal.

05-Apr-04 15:51:32, Pascal Schmidt wrote to Jasen Betts


 PS> Hi Jasen! :-)

 JB>> I figured squares in D would be easier to find than primes to put
 JB>> in for A and B. (not using primes could be slower... using
 JB>> mostly-primes could work I guess)
 PS> Yeah, I was thinking one could do a decode run for some
 PS> combination of A and B that looks likely and then look at the
 PS> result. However, there may be no way to discern a successful
 PS> decode from gibberish

IIRC there's more work doing the decode than there is multiplying a pair of
candidates for A and B

in PGP, RSA is used to encode a key to decode IDEA endoced data...
and that key is going to look just like a random number.

 JB>> I've not looked closely at the binary implementation of SQRT. but
 JB>> IIRC the best implementation is O(n*log(n)) (for n bits)

 PS> I'd be using the gmp (GNU math precision) library. However, its
 PS> documentation doesn't say how effecient their sqrt() is

I'll have a look at gmp.

 -=> Bye <=-

---