Re:Experimenting with Post-Quantum Cryptography
by aruss on Thursday July 07, 2016 @02:25PM
(#12051179)
That's right, symmetric encryption is fine. You're also right that protocols that rely on factoring or discrete log (more generally, any hidden subgroup problem) will be broken by quantum computers. However, this still means symmetric encryption is in trouble; namely in that we still need a post-quantum method for exchanging keys, otherwise symmetric ciphers will be virtually useless.
[ Parent
| on HN ]
Re:Experimenting with Post-Quantum Cryptography
by e12e on Friday July 08, 2016 @02:10AM
(#12053836)
How about hashing - in particular wrt key derivation? Does anyone have some insight there? Is it likely passphrase+salt+stretching might be in danger from quantum attacks? (I also wonder if DNA/RNA based biologic computing (or computing inspired by biology) might somehow change things around in terms of guessing passwords or look for hash collision...)
Re:Experimenting with Post-Quantum Cryptography
by indolering on Friday July 08, 2016 @10:07PM
(#12059754)
Hashing is in a similar position in that we just need to increase the size. Biological computing is (AFAIK) irrelevant to the speedups provided by quantum mechanics.
Re:Experimenting with Post-Quantum Cryptography
by e12e on Saturday July 09, 2016 @02:08AM
(#12060338)
> Hashing is in a similar position in that we just need to increase the size.
Size of hash, or number of iterations? Or either? And will it still be "convenient security" available for those that "only" have classical computers? (ie: is will be get away with "small" increases in size, and get to keep (some of) our current speed)?
> Biological computing is (AFAIK) irrelevant to the speedups provided by quantum mechanics.
I didn't think otherwise. But they might be relevant to combinatorial problems, and so relevant to security?