Re: RSA Challenges
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 23 May 2007 10:15:28 +0300
"Sebastian G." <seppi@xxxxxxxxx> writes:
Phil Carmody wrote:
You seem to be missing the fact that most improvements to SNFS
implementations can probably assist GNFS implementations too. For
example, if their latest crack
utilised a more easily parallelisable linear algebra algorithm or
implementation, then that would also almost certainly assist future
GNFS cracks too.
Still these improvements are comparably negligible on the huge
improvement that SNFS offered over GNFS for this special case. So even
with these little detail improvements, you're not nearby close to
cracking a RSA-style composite of this size.
YOU ARE COMPLETELY MISSING THE POINT.
YES, I AM SHOUTING.
Phil
--
"Home taping is killing big business profits. We left this side blank
so you can help." -- Dead Kennedys, written upon the B-side of tapes of
/In God We Trust, Inc./.
.
- Follow-Ups:
- Re: RSA Challenges
- From: Francois Grieu
- Re: RSA Challenges
- References:
- RSA Challenges
- From: Pubkeybreaker
- Re: RSA Challenges
- From: Sebastian G.
- Re: RSA Challenges
- From: Pubkeybreaker
- Re: RSA Challenges
- From: Sebastian G.
- Re: RSA Challenges
- From: Kristian Gjøsteen
- Re: RSA Challenges
- From: Sebastian G.
- Re: RSA Challenges
- From: Sebastian G.
- Re: RSA Challenges
- From: Phil Carmody
- Re: RSA Challenges
- From: Sebastian G.
- Re: RSA Challenges
- From: Phil Carmody
- Re: RSA Challenges
- From: Sebastian G.
- RSA Challenges
- Prev by Date: Re: RSA Challenges
- Next by Date: Re: snfs factorization of a 1039-bit number
- Previous by thread: Re: RSA Challenges
- Next by thread: Re: RSA Challenges
- Index(es):
Relevant Pages
|