3 ms·

So, my understanding was that the questions of quantum cryptography stem from the fact that cryptographic algorithms designed to stump current computers will be

So, my understanding was that the questions of quantum cryptography stem from the fact that cryptographic algorithms designed to stump current computers will be a breeze for quantum computers, so new algorithms will need to be created to stump quantum computers. I thought that's what was referred to as "quantum encryption". Is there another name for what I'm thinking of? But now they're saying that this "quantum encryption" they speak of will be "perfectly" secure? Does this mean that, once established, cryptography will no longer need to be a field of study? Also this: "This solves the problem by embedding it in an extra abstract dimension, which is independent of space. So as long as both Alice and Bob know the way in which all these abstract dimensions are related, the third provides a reference against which measurements of the other two can be made." blows my mind. The fact that this "other dimension" stuff is no longer just speculation, but will soon be part of our lives.

scscsc 17y ago
It's two different things: - one, quantum computers can theoretically do factoring in polynomial time and therefore theoretically break schemes such as RSA (such schemes are proven secure provided that some computational problem is intractable -- in the quantum world the problem becomes tractable) - two, you can theoretically use entanglement to achieve "perfect cryptography". The "perfectness" result is an absolute impossibility result in physics, and therefore no computer (classic or quantum) can break it. Details on wikipedia: http://en.wikipedia.org/wiki/Quantum_cryptography http://en.wikipedia.org/wiki/Quantum_cryptography The article refers to number two, although in a rather non-technical manner. Edit: clarifications.
- Daniel_Newby 17y ago
  I would not call it perfect: you still need a classical message authentication code to protect against a man in the middle attack.

scscsc 17y ago

It's two different things: - one, quantum computers can theoretically do factoring in polynomial time and therefore theoretically break schemes such as RSA (such schemes are proven secure provided that some computational problem is intractable -- in the quantum world the problem becomes tractable) - two, you can theoretically use entanglement to achieve "perfect cryptography". The "perfectness" result is an absolute impossibility result in physics, and therefore no computer (classic or quantum) can break it. Details on wikipedia: http://en.wikipedia.org/wiki/Quantum_cryptography http://en.wikipedia.org/wiki/Quantum_cryptography The article refers to number two, although in a rather non-technical manner. Edit: clarifications.

Daniel_Newby 17y ago
I would not call it perfect: you still need a classical message authentication code to protect against a man in the middle attack.