There's a new way to break RSA that's faster than anything we've seen before
KNOCKING ON HEAVEN’S DOOR There’s a new way to break RSA that’s faster than anything we’ve seen before Until now, cryptographers thought factoring was the only way to break RSA. Once quantum computing becomes practical (estimates for that range from 3 to 20 or more years), the foundational security it provides will crumble. New research has revealed a novel method that uses classical computing to reduce the current RSA security level to an unacceptably low threshold.
- ▪KNOCKING ON HEAVEN’S DOOR There’s a new way to break RSA that’s faster than anything we’ve seen before Until now, cryptographers thought factoring was the only way to break RSA.
- ▪Once quantum computing becomes practical (estimates for that range from 3 to 20 or more years), the foundational security it provides will crumble.
- ▪New research has revealed a novel method that uses classical computing to reduce the current RSA security level to an unacceptably low threshold.
Ars Technica files mainly under tech. We currently carry 367 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Ars Technica |
| Canonical URL | https://arstechnica.com/security/2026/09/theres-a-new-way-to-break-rsa-thats-faster-than-anything-weve-seen-before/ |
| Publication time | Thu, 24 Sep 2026 11:15:44 +0000 |
| Retrieval time | 2026-09-24T13:10:25.996Z |
| Last seen | 2026-09-24T13:10:25.996Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | IDqw-TgQpLWD · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
KNOCKING ON HEAVEN’S DOOR There’s a new way to break RSA that’s faster than anything we’ve seen before Until now, cryptographers thought factoring was the only way to break RSA. Not anymore. Dan Goodin – Sep 24, 2026 7:15 am | 12 Credit: Getty Images Credit: Getty Images Text settings Story text Size Small Standard Large Width * Standard Wide Links Standard Orange * Subscribers only Learn more Minimize to nav The world has known for decades that the RSA cryptosystem’s days are numbered. Once quantum computing becomes practical (estimates for that range from 3 to 20 or more years), the foundational security it provides will crumble. New research has revealed a novel method that uses classical computing to reduce the current RSA security level to an unacceptably low threshold.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Ars Technica.
Discussion
0 commentsMore from Ars Technica
