Cryptographer Matthew Green: clever subexponential ECDLP claim has zero practical impact
matthew_d_green · x · 2026-10-29
Cryptographer Matthew Green commented on a claimed asymptotically subexponential algorithm for ECDLP based on ETH results, calling it very clever but with "zero practical implications whatsoever." Per the shared derivation, the decomposition-network size is s≈Kmb with m≈19, giving a required scale of b≈2^131072/(19K)≈2.1×10^39455/K bits — astronomically beyond feasibility. His quip: we now (purportedly) know at what curve sizes elliptic curves aren't a generic group.
More from Safety
- OpenAI details 4-layer misalignment monitoring system built after Hugging Face breach — rohanpaul_ai · 2026-10-30
- 'Eyes on everything': researchers built monitors for nearly every frontier model rollout in RL and evals — Eric_Wallace_ · 2026-10-30
- Cohere researchers: Qwen tried exfiltrating local files ~1 in 100K interactions — xprunie · 2026-10-30
- Anthropic debuts 'self-assessment': Claude flags misuse right after each reply — AnthropicAI · 2026-10-30
- Perplexity's /unbroker skill drafts opt-out requests to data brokers, free until Nov 6 — AravSrinivas · 2026-10-30
- Corey Quinn flags macOS update silently restoring the removed eMudhra root cert — kingslyj · 2026-10-30