View Single Post
Old 2014-04-04, 20:19   #2
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

22·5·373 Posts
Default

Quote:
Originally Posted by Unabomber View Post
It is bothering my why I have never read ideas on this, not a single word. Eventhough it may be due to my unknowledge on this subject. If I am wasting time of forum goers, please forgive me.

Any odd integer x in can be presented in the form x = a^2 - b^2. Being so, there must be quadratic residues d and e modulo n, a = d - e, where a is remainder of x modulo n ,and n arbitrary integer number.

<snip>
I will be generous and assume that the post is just poorly written.

Factoring x by difference of squares with exclusion moduli (which is what
you are discussing, if in a confused way) is strictly an exponential time
algorithm. --> worthless for numbers of any moderate (e.g. 25+ digits)
size.
R.D. Silverman is offline   Reply With Quote