RSA Challenge Question
- From: "Curious_1" <infinity100@xxxxxxxxxxx>
- Date: 10 Feb 2007 20:37:44 -0800
Hi there,
This might seem like a silly question but I wanted to know .... what
would happen if someone came up with a polynomial time algorithm for
solving the hardest of RSA Challenge numbers?
Let's even take it to it's logical extreme .... what would happen if
someone came up with a general method for integer factorization that
was as simple (and equally time consuming) as multiplying the factors
to arrive at the product?
Would this person's life be over as they knew it? Would they be
assassinated? Would they be forced to live the rest of their lives in
some sort of Siberia, with no contact with the rest of the world???
Again, silly question ... but would probably make for a good novel or
movie!
.
- Follow-Ups:
- Re: RSA Challenge Question
- From: Joseph Ashwood
- Re: RSA Challenge Question
- From: Mike Amling
- Re: RSA Challenge Question
- From: Unruh
- Re: RSA Challenge Question
- Prev by Date: Re: Key entropy, stream entropy, block entropy, block population entropy AKA uniique stream length
- Next by Date: Same message XORed with different keys each time
- Previous by thread: On the Strength of the Strong RSA Assumption
- Next by thread: Re: RSA Challenge Question
- Index(es):
Relevant Pages
|
