mersenneforum.org > Math On crt based factorization?
 Register FAQ Search Today's Posts Mark Forums Read

 2014-04-04, 19:20 #1 Unabomber   Apr 2014 116 Posts On crt based factorization? 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. There are various, and really various, numbers n and residues, where this condition is meat only once. Solution in unique. For example, if number to be factorized is of the form 8n+1, then a must be of form 8n+1 and b of the form 8n. Like numbers 3*11 = 7^2-8^2 are. How fast can factorization be, using these facts and chinese remainder theorem? If the amount of these solutions is small and modulo is large, a large amount of factors is outsieved. Could this be useful?
2014-04-04, 20:19   #2
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

23·3·311 Posts

Quote:
 Originally Posted by Unabomber 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.
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.

 Similar Threads Thread Thread Starter Forum Replies Last Post carpetpool Miscellaneous Math 5 2018-02-05 05:20 c10ck3r Math 1 2012-02-22 06:29 Googol Information & Answers 2 2007-07-27 03:09 ewmayer Puzzles 7 2007-04-19 22:33 ThomRuley Software 2 2004-03-21 15:30

All times are UTC. The time now is 14:37.

Sat Aug 13 14:37:34 UTC 2022 up 37 days, 9:24, 2 users, load averages: 1.15, 1.02, 1.09