A paper that shows how elliptic-curve-based cryptography becomes increasingly vulnerable by QCs:

From the paper’s abstract:
“Solving the Discrete Logarithm problem on the group of points of an elliptic curve is one of the major cryptographic applications of Shor’s algorithm. However, current estimates for the number of qubits required remain relatively high, and notably, higher than the best recent estimates for factoring of RSA moduli. […]

In this paper, we propose an alternative approach to the computation of point multiplication in Shor’s algorithm […]

This strategy allows us to obtain the most space-efficient polynomial-time algorithm for the ECDLP to date, with only 3.12n + o(n) qubits, at the expense of an increase in gate count, from O(n^3) to O(n^4). […]”