If Alice and bob have a secure channel for key-exchange and mallory don't man-in-the-middle attack them but in the future eavesdrop connection and see the key exchanged, can mallory break it like RSA with a quantum computer?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
A quantum computer solves the discrete logarithm problem for both finite fields and elliptic curves. Being able to efficiently calculate discrete logarithms implies being able to break Diffie-Hellman, so Diffie-Hellman on either of them is not secure against an adversary who owns a large quantum computer.
There might be other groups in which DL problem is hard even against a quantum computer, but I've never heard of such a group.