On Tue, Aug 31, 2004 at 02:45:29PM -0400, Whyte, William wrote: > > My understanding is that once you've used trial division to > get rid of all the extremely short divisors, a random number > of length n is about as hard to factor as an RSA modulus of > the same length. I don't think there are a lot of easy-to-factor > moduli around.
One would think that the more one knows about the factors, the easier factoring would be. Since we know an RSA modulus contains exactly two primes, usually each half the length of the modulus, factoring an RSA modulus should be easier than factoring a random number of about the same size. This depends, of course, on being able to use a method which takes advantage of the additional information. The simple case for factoring easy RSA modulii occurs when the primes are too close together rather than being small. Other easy cases are based on other accidental characteristics. -- [EMAIL PROTECTED] --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
