Most modern asymmetric encryption (public key encryption) is not resistant to attacks with quantum computers because modern public keys are based on something called "hidden subgroup problems" which can be solved easily with quantum computers (if they existed).
However, quantum-resistant asymmetric encryption does exist, it is just not yet common or battle-tested.
Of course, all of this depends (as usual) on complexity theory conjectures. Very plausible conjectures, but not yet strictly proven theorems.
7 comments
[ 602 ms ] story [ 2300 ms ] threadHistory repeats itself, or perhaps it never ended, or rather it already ended
What make it “post quantum”?
Isn’t all symmetric encryption pretty quantum resistant?
(Including one time pads, AES, etc?)
Most modern asymmetric encryption (public key encryption) is not resistant to attacks with quantum computers because modern public keys are based on something called "hidden subgroup problems" which can be solved easily with quantum computers (if they existed).
However, quantum-resistant asymmetric encryption does exist, it is just not yet common or battle-tested.
Of course, all of this depends (as usual) on complexity theory conjectures. Very plausible conjectures, but not yet strictly proven theorems.
Thanks for the explainer I’ll read on this when I get some free time.