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… Read more »