discrete logarithm problem

Researchers with the Bochum crypto group have published a proposed subexponential-time algorithm for the elliptic curve discrete logarithm problem, the mathematical task underpinning elliptic curve cryptography. The work is available on GitHub with accompanying paper. If verified, such a result would have major implications for the security assumptions of widely deployed cryptographic systems, though claims of this magnitude typically require extensive peer scrutiny before being accepted.