-----BEGIN PGP SIGNED MESSAGE----- Timothy C. May wrote: [..]
Now, is the modulus, n = pq, any more factorable than if a "more random" source of p and q were used?
(I am actually asking this as a real question. Does anyone know if factoring is significantly easier for such not-completely-random numbers? I would expect that in theory it is, but in practice this is not a useful point of entry into factoring n. Just a hunch.)
Only if I can have a good enough idea of the non-random method for generating numbers, or if I can find some useful statistical correlations in your numbers. (And then again, what do you mean by "significantly easier"? Knowing 1 bit reduces the work by half, but with orders or thousands of bits, it's not much help.) Whether I can realisitically reproduce or work with that non-random method of key generation is another matter, though. Rob. - --- [This message has been signed by an auto-signing service. A valid signature means only that it has been received at the address corresponding to the signature and forwarded.] -----BEGIN PGP SIGNATURE----- Version: 2.6.2 Comment: Gratis auto-signing service iQBFAwUBMTkHYCoZzwIn1bdtAQHdSgGAzgoS4Y1BQuI5hzlsLsfnoKyzVALJD3TR Mm5Dmu/I5N3Rnk9TxNviwLFjKp6Fd35Z =UnWo -----END PGP SIGNATURE-----