Re: Critiquing surrogate factoring
From: David Kastrup (dak_at_gnu.org)
Date: 03/30/05
- Next message: Pubkeybreaker: "Re: Naive Square root algorithm for GNFS ?"
- Previous message: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- In reply to: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- Next in thread: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- Reply: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 30 Mar 2005 17:36:46 +0200
"Pubkeybreaker" <Robert_silverman@raytheon.com> writes:
> The concept is not new and has been used since 1970. It was first
> invented by Brillhart and Morrison. (and had been suggested but
> never fully developed by Lehmer as far back as the 1930's. It was
> not realizable until modern computers became available)
IIRC, Fermat's factoring method also works by factoring something
else.
-- David Kastrup, Kriemhildstr. 15, 44793 Bochum
- Next message: Pubkeybreaker: "Re: Naive Square root algorithm for GNFS ?"
- Previous message: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- In reply to: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- Next in thread: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- Reply: Pubkeybreaker: "Re: Critiquing surrogate factoring"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]