Re: RSA Challenge Question
- From: Unruh <unruh-spam@xxxxxxxxxxxxxx>
- Date: Sun, 11 Feb 2007 09:38:18 +0100 (CET)
"Curious_1" <infinity100@xxxxxxxxxxx> writes:
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?
They would probably win the Fields medal. And public key crypto would have
to find a different trapdoor function.
The chances are negigible however.
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???
No. No . No. No.
Again, silly question ... but would probably make for a good novel or
movie!
.
- Follow-Ups:
- Re: RSA Challenge Question
- From: AvengerD
- Re: RSA Challenge Question
- References:
- RSA Challenge Question
- From: Curious_1
- RSA Challenge Question
- Prev by Date: Same message XORed with different keys each time
- Next by Date: Re: Same message XORed with different keys each time
- Previous by thread: RSA Challenge Question
- Next by thread: Re: RSA Challenge Question
- Index(es):
Relevant Pages
|