Re: If you found a fast integer factorization algorithm.
- From: pubkeybreaker <pubkeybreaker@xxxxxxx>
- Date: Fri, 29 May 2009 14:28:45 -0700 (PDT)
On May 29, 5:12�pm, "Bill J." <nola...@xxxxxxxxx> wrote:
I was doing some reading on number theory the other day, and I noticed
that RSA pulled their factorization challenge prizes. This got me to
thinking about the potential motivations for prime factorization
research. Since the RSA challenge is dead, what would you do if you
found a polynomial-time integer factorization algorithm? I suppose the
illegal and unethical options are obvious, but what are the legal
options? Publish a paper and leverage it to get a tenured position in
a math department somewhere? What else?
Sell short on security software companies before the
announcement. This is legal. You are not an
insider.
Act ethically and notify the IETF so SSL and
other protocols can be changed in a clean manner.
Notify public certificate companies so RSA signatures
can be changed to EC.
.
- Follow-Ups:
- Re: If you found a fast integer factorization algorithm.
- From: Paul Rubin
- Re: If you found a fast integer factorization algorithm.
- References:
- If you found a fast integer factorization algorithm.
- From: Bill J.
- If you found a fast integer factorization algorithm.
- Prev by Date: If you found a fast integer factorization algorithm.
- Next by Date: Re: If you found a fast integer factorization algorithm.
- Previous by thread: If you found a fast integer factorization algorithm.
- Next by thread: Re: If you found a fast integer factorization algorithm.
- Index(es):
Relevant Pages
|
