Re: A very fast Fermat factoring algorithm
From: Tim Smith (reply_in_group_at_mouse-potato.com)
Date: 04/02/05
- Previous message: Gregory G Rose: "Re: is an MD5 sum random"
- Maybe in reply to: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- Next in thread: ralfe.cookson_at_trw.com: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 02 Apr 2005 03:50:44 GMT
In article <1112279215.645034.272050@z14g2000cwz.googlegroups.com>,
"Pubkeybreaker" <Robert_silverman@raytheon.com> wrote:
> One hallmark of a crank is claiming something new, but then refusing
> to reveal it.
...
> BTW, I am *very* skeptical of your 10^9 speed-up claim.
I think you are jumping to conclusions here. The OP (at least at this
point in the thread...I haven't read to the end yet) has not done
anything that indicates he won't reveal his program. Rather, it sounds
like he's asking if there is any point in it--he's found something that
is definitely new *to* *him* and wants to know if it is something that
is new to everyone else.
That is a very reasonable thing for him to do.
-- --Tim Smith
- Previous message: Gregory G Rose: "Re: is an MD5 sum random"
- Maybe in reply to: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- Next in thread: ralfe.cookson_at_trw.com: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|