Yhn BusinessCrypto first seen 13 d ago, last 7 d ago, peak #3
Subexponential Algorithm Proposed for Elliptic Curve Discrete Logarithm
Original: A Subexponential Time Algorithm for Elliptic Curve Discrete Logarithm
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.
Why now: A claimed breakthrough against a core cryptographic assumption would affect the security of widely used encryption, drawing immediate attention from the security community
Bochum crypto groupelliptic curve cryptographyGitHub
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/4134959