Yhn BusinessCrypto first seen 5 d ago, last 46 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 algorithm claimed to solve the elliptic curve discrete logarithm problem in subexponential time has been released with code on GitHub, attributed to a cryptography group in Bochum. If correct, the result would undermine the security assumptions behind elliptic curve cryptography, which protects much of modern internet traffic. Readers are debating the claim's validity and its implications.
Why now: A claimed breakthrough against the hardness assumption underpinning elliptic curve cryptography would have major security consequences, drawing intense scrutiny.
Bochum cryptography groupelliptic curve cryptographyGitHub
Rank over time, top of the chart is #1. 97 snapshots from 5 d ago to 46 min ago.
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/4134959