logarithms

A new algorithm claiming subexponential time for the elliptic curve discrete logarithm problem has been published, with code released on GitHub by the Bochum crypto group. If verified, the result would undermine the security assumptions behind much of modern elliptic curve cryptography, including widely used key exchange and signature schemes.