Yhn BusinessCrypto first seen 5 d ago, last 15 min ago, peak #3
Researchers Claim Subexponential Algorithm for Elliptic Curve Discrete Logarithm
Original: A Subexponential Time Algorithm for Elliptic Curve Discrete Logarithm
A new paper from the Bochum cryptography group claims a subexponential time algorithm for the elliptic curve discrete logarithm problem, the mathematical basis underpinning widely used elliptic curve cryptography. A public GitHub repository accompanies the work. If the claim holds up under review, it would be a major theoretical breakthrough, since elliptic curve discrete logarithms have long been believed to resist anything better than square-root complexity, and such a result could undermine the security assumptions of common cryptographic schemes.
Why now: A claimed breakthrough against the core problem behind elliptic curve cryptography has major implications for digital security, drawing close scrutiny from cryptographers.
Bochum cryptography groupelliptic curve cryptography
Rank over time, top of the chart is #1. 2 snapshots from 1 h ago to 15 min ago.
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/4134959