I believe that quantum computers only give a square root speedup for bruteforcing symmetric encryption algorithms, so we'd just have to double the key length of those.
Asymmetric algorithms based on the hardness of factoring or calculating discrete logarithms are broken, though.
Comments
I believe that quantum computers only give a square root speedup for bruteforcing symmetric encryption algorithms, so we'd just have to double the key length of those.
Asymmetric algorithms based on the hardness of factoring or calculating discrete logarithms are broken, though.