Cryptographer: AI doing amazing math puts elliptic curve hardness in no danger
markjeffrey · x · 2026-10-08
Cryptographer Yehuda Lindell notes that we can't prove EC discrete log is hard precisely because P != NP remains unproven — but dismisses the claim that AI's amazing math progress puts elliptic curve hardness in danger as having "no logical basis whatsoever."
More from Safety
- Amazon's About You page lets shoppers read AI inferences, including 'has flat buttocks' — aakashgupta · 2026-10-08
- Dev Building Runtime Authorization Layer for AI Agents Seeks Real Teams to Sandbox-Test It — Invisible_act1988 · 2026-10-08
- Devs debate session-level runtime authorization on top of MCP's static config for agents — Longjupping_Tax_3598 · 2026-10-08
- ColPali-style visual document indices can be inverted: 47% of words recovered, source page ranked first 98.4% — _reachsumit · 2026-10-08
- The AI safety debate has a framing problem: nobody actually argues against safety — Smart_Fly_5783 · 2026-10-08
- AI could end encryption as we know it: math breakthroughs threaten public-key crypto — sebkrier · 2026-10-08