Re: Factoring problem, my assertion revisited

From: ošin (ošin_at_ragnarok.com)
Date: 02/08/05 

Date: Tue, 8 Feb 2005 08:19:34 -0800

> Those of you who actually know about public key encryption know that
> the two prime factors are carefully chosen to make the number hard to
> factor, so the process of picking some j, to get M^2 - j^2 would
> disrupt that choosing.

Nope. They are not carefully chosen. If that were true, then there would be
a much smaller set to test against, making it easier to break into. The main
thing is that the factors should be both large, but not close to eachother
in value. So it seems that your idea depends on a false assumption. But
probably, T is no easier to factor than M.