Shor's algorithm, which runs partially on a classical computer and a portion on a quantum computer, breaks elliptic-curve cryptography.
https://www.cs.umd.edu/~amchilds/teaching/w08/l03.pdf
May help if you're actually interested.
Edit: More signed transactions help with the classical and not the quantum part of schor.
Edit2: Schor has not yet even been able to factor the integer 35 with current quantum hardware, too much interference.
> currently Shor's algorithm is unfeasible with only 1 signed message.
The algorithm is currently unfeasible with 100s of messages. Shor's algorithm uses a quantum computer to reduce the complexity of integer factorization from sub-exponential to polynomial-time. It is not an attack that fine-tunes the output according to the amount of network traffic.