3 ms·
For what it's worth, you don't really need your problems to be NP-hard to resist quantum computers. You just don't want problems that are in the BQP (or P, obvi
by pbsd 13y ago
For what it's worth, you don't really need your problems to be NP-hard to resist quantum computers. You just don't want problems that are in the BQP (or P, obviously) complexity class.
Why bring up OTPs if current symmetric encryption is quantum-computing proof (modulo Grover)? If anything, OTPs just leave you with a much bigger (literally) key exchange problem, without any meaningful advantage.
With all that said, "scalable quantum computers" are very much like the year of the Linux desktop, or cold fusion: always just a few years from now.
- bascule 13y agoI brought up OTP because it actually provides perfect secrecy, unlike "perfect" forward secrecy. And yes, we won't know when (or for the true pessimists, if) quantum computers capable of breaking today's public keys will be available. And as another counterpoint, D-Wave's technology appears to be a bit overblown: http://www.scottaaronson.com/blog/?p=1400 http://www.scottaaronson.com/blog/?p=1400