RSA would be in trouble if the polynomial-time factoring rumor is real, but EC keys are another story
tallmetommy · x · 2026-11-22
- Reacting to the rumor of a classical polynomial-time factoring algorithm, the author argues that if true, RSA — which relies on the hardness of integer factorization — would be in serious trouble.
- However, Bitcoin and Ethereum wallet keys use elliptic curves, which rest on the discrete logarithm problem. Shor's quantum algorithm breaks both, but a classical factoring trick would also need to crack discrete logs before crypto wallets are at risk.
- In short: even if the rumor holds, RSA-style public-key crypto is in danger while elliptic-curve systems may survive for now.
Related event: Rumors of Polynomial-Time Factoring Algorithm Stir RSA Fears(2 posts)→
More from Safety
- Two French texts align: guide kids' AI and screen use, don't ban it — LeelooAI_fr · 2026-11-22
- Reddit user claims Gemini knew his keyboard's USB device name, then denied it — Pyro2745 · 2026-11-22
- Don't wire a chatbot to your personal WhatsApp: prompts make terrible firewalls — uriwa · 2026-11-22
- Five refusals our phone-calling MCP server enforces in code, not in the prompt — FunBus8049 · 2026-11-22
- Google's Mirror Dimension: synthetic web for safe browser-agent testing — shashib · 2026-11-22
- Cryptographer warns frontier AI math is already good enough to break cryptography — rickasaurus · 2026-11-22