Re: JSH: What is surrogate factoring? Once more.
- From: riderofgiraffes <mathforum.org_am@xxxxxxxxxxxxxx>
- Date: Tue, 04 Sep 2007 12:12:53 EDT
I think you are overlooking what is maybe the
central unavoidable problem with the Harris idea.
As with Fermat's algorithm (and Dixon's, and the
quadratic sieve), he wants
X^2 = Y^2 mod T, i.e.,
(X + Y)*(X - Y) = 0 mod T.
So say T = 77. Let k = 1 and n = 2.
You can't do this. He assumes that k=2x (T)
*THAT'S* the central, unavoidable problem.
.
- Follow-Ups:
- Re: JSH: What is surrogate factoring? Once more.
- From: marcus_b
- Re: JSH: What is surrogate factoring? Once more.
- Prev by Date: Re: I dont know what to do.
- Next by Date: Re: Is the computation of x=a(mod b) where a is 8*10^5 bit length positive interger and b is 80 bit length positive interger realistic?
- Previous by thread: Re: JSH: What is surrogate factoring? Once more.
- Next by thread: Re: JSH: What is surrogate factoring? Once more.
- Index(es):
Relevant Pages
|
