Yhn BusinessCrypto first seen 6 d ago, last 56 min ago, peak #3
Subexponential Algorithm Proposed for Elliptic Curve Discrete Logarithm Problem
Original: A Subexponential Time Algorithm for Elliptic Curve Discrete Logarithm
Researchers from the Bochum crypto group have released a proposed subexponential-time algorithm for the elliptic curve discrete logarithm problem, the mathematical foundation underpinning widely used elliptic curve cryptography. A code repository accompanying the work has been made public on GitHub, prompting discussion among cryptographers about whether the claimed complexity bound holds and what it would mean for the security of elliptic curve-based systems if confirmed.
Why now: A claim of subexponential attack complexity on a core cryptographic problem would have major implications for the security of widely deployed encryption.
Bochum crypto groupelliptic curve cryptographyGitHubdiscrete logarithm problem
Rank over time, top of the chart is #1. 52 snapshots from 2 d ago to 56 min ago.
Evidence
API: https://socialmediatrends-api.osmike.com/v1/trends/4134959