Elliptic curve crypto (the kind that is in common use, like ECDH) is just as broken by quantum computers as RSA. The quantum algorithm that breaks RSA (Shor's

Elliptic curve crypto (the kind that is in common use, like ECDH) is just as broken by quantum computers as RSA. The quantum algorithm that breaks RSA (Shor's algorithm) does it by efficiently solving the hidden subgroup problem[1] for finite Abelian groups. This can be used for factoring integers (which breaks RSA) and also for solving discrete logarithms (which breaks elliptic curve crypto). [1] https://en.wikipedia.org/wiki/Hidden_subgroup_problem https://en.wikipedia.org/wiki/Hidden_subgroup_problem