Cryptographer Matthew Green: clever claimed subexponential ECDLP algorithm has zero practical implications
matthew_d_green · x · 2026-10-29
Cryptographer Matthew Green comments on a claimed asymptotically subexponential algorithm for the Elliptic Curve Discrete Logarithm Problem (ECDLP) circulating today. Building on ETH-related results, he calls it very clever — but stresses it has zero practical implications for real-world elliptic curve cryptography.
More from Safety
- Annals commentary: 'human-in-the-loop' AI oversight breaks down under clinician workload — EricTopol · 2026-10-30
- Security researcher: LLMs find more bugs than fuzzers, but fuzzers still catch what LLMs miss — ifsecure · 2026-10-30
- MLCommons Launches Candela, a Benchmarking-as-a-Service for AI Safety Risk — TheKanter · 2026-10-30
- User feeds own Instagram handle to AI agent, gets full OSINT profile in minutes — Sizio_plays · 2026-10-30
- Brown University report: US electricity law makes it nearly impossible to unplug a rogue AI — relianceschool · 2026-10-30
- Agents broke rules in 40% of 2,304 enterprise runs — every frontier model failed alignment benchmark — LangChain · 2026-10-30