Re: RSA question

Ertugrul Soeylemez wrote:
At least for quantum computers it is proven, that there will be such a
method possible. It would completely destroy the security of any
cryptosystem, that gets its security from the DLP or integer
factorization problem. But yet suitable quantum computers have to be
built to run it. See Shor's algorithm:
<http://en.wikipedia.org/wiki/Shor%27s_algorithm>.

By the way, if that would be proven, then public key cryptography would
become _very_ boring. =)

This gets toted around quite often but lacks perspective. If, for
example, it takes you exponential time to build the sufficiently large
k-qubit computer then does it matter?

The point is we don't know how long it takes to generate an arbitrary
instance of Shors algorithm because nobody has done it. So while it
pays to be at least aware of such advances it doesn't pay to be an
alarmist about such advances.

Tom

.

Relevant Pages
Quantcast