Yhn BusinessCrypto first seen 4 d ago, last 37 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 research result from the Bochum cryptography group claims a subexponential-time algorithm for solving the elliptic curve discrete logarithm problem, the mathematical assumption underpinning widely used elliptic curve cryptography including TLS, Bitcoin and Signal-style encryption. If verified, such a result would be a major break with the long-standing belief that the problem resists subexponential attacks, forcing a rethink of curve-based security estimates.
Why now: A claimed breakthrough against the hardness assumption behind elliptic curve cryptography would have major implications for global digital security
Bochum cryptography groupelliptic curve cryptographyelliptic curve discrete logarithm problem
Rank over time, top of the chart is #1. 82 snapshots from 4 d ago to 37 min ago.
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/4134959