Yhn BusinessCrypto first seen 4 d ago, last 9 min ago, peak #3
Claimed Subexponential Algorithm for Elliptic Curve Discrete Logarithm
Original: A Subexponential Time Algorithm for Elliptic Curve Discrete Logarithm
Researchers from the Ruhr University Bochum cryptography group have released an algorithm claiming subexponential time complexity for the elliptic curve discrete logarithm problem, the mathematical task underlying the security of elliptic curve cryptography. A code repository accompanies the claim. Because such a result would undermine widely used cryptosystems including much of TLS and Bitcoin, experts are scrutinising the work closely and debating whether the claim holds.
Why now: If true, the result would threaten the security foundations of elliptic curve cryptography used across the internet, prompting intense scrutiny and discussion.
Ruhr University Bochumelliptic curve cryptographyGitHub
Rank over time, top of the chart is #1. 78 snapshots from 4 d ago to 9 min ago.
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/4134959