Sunday 4 October 2026
Afternoon EditionRSS
ZOTPAPER

News without the noise

ZOTPAPER
Security

New Classical Attack on RSA Reduces Security Threshold, Researchers Say

Signature forgery method cuts computing needs but poses no immediate practical threat

By LineZotpaper
Published
Read Time2 min
Researchers have demonstrated a novel classical computing method that breaks RSA keys significantly faster than previous techniques, reducing the cryptosystem's effective security level to an unacceptably low threshold. While the attack introduces a previously unknown route — signature forgery without factoring — cryptographers say it poses little immediate practical danger, except in limited edge cases.

For decades, the security of the RSA cryptosystem has been understood to be finite, threatened ultimately by the advent of practical quantum computing, which estimates suggest could arrive anywhere from three to twenty or more years from now. But new research has shown that classical computing alone can attack RSA more efficiently than anything seen before.

The finding relies on a new method of breaking RSA keys without factoring them, instead forging signatures directly. According to researchers, this approach reduces the required computing resources by orders of magnitude compared with existing classical attacks.

Despite the theoretical advance, the attack is not an immediate practical concern. Even against the deprecated use of 1024-bit keys, the method demands more computation than almost any organisation — short of a nation-state or a company with massive resources — could realistically mount. Widely used RSA implementations remain safe, researchers said.

Nonetheless, the research has taken cryptographers by surprise. The introduction of signature forgery as a fresh attack vector, coupled with the dramatic reduction in computational cost, challenges long-held assumptions about RSA's resilience in the classical era. The work is seen as an important signal that the timeline for migrating away from RSA may need to be reconsidered, even before quantum computers become viable.

§

Analysis

Why This Matters

  • RSA underpins much of modern encryption, from TLS certificates to secure email and digital signatures. A cheaper classical attack accelerates the urgency of migrating to post-quantum cryptography.
  • The fact that the attack works without factoring keys is a paradigm shift — defences and mitigation strategies were largely designed around factoring-based attacks.
  • Even if not practical today, the method's efficiency gains could be refined further, potentially bringing RSA within reach of well-resourced adversaries sooner than expected.

Background

RSA's security relies on the computational difficulty of factoring large composite numbers. For years, the accepted countermeasure was simply increasing key sizes. Quantum computing, however, is expected to break RSA entirely via Shor's algorithm. The new research, by contrast, uses classical algorithms to achieve a significant speedup, lowering the effective security margin while leaving current implementations largely untouched for now. This is a background that frames the finding as part of the broader, ongoing transition away from RSA toward quantum-resistant algorithms.

Key Perspectives

Cryptographers: Surprised by the novel signature-forgery vector, they view it as a significant theoretical breakthrough that could influence future cryptographic standards and force earlier adoption of post-quantum alternatives. Systems administrators and enterprises: They may see the attack as a distant concern, given the enormous computational requirements, but will likely monitor the research for follow-up refinements that could lower the bar. Critics/Skeptics: Some may point out that the attack's practicality remains untested against real-world key sizes, and that even 1024-bit keys — already deprecated — are beyond most attackers' reach. The risk, they argue, remains theoretical for the near term.

What to Watch

  • Whether follow-up research reduces the computational requirements further, especially for 2048-bit keys.
  • Updates from standards bodies (e.g., NIST) regarding RSA's recommended lifespan in light of the new attack.
  • Any demonstrations by researchers applying the method to real-world signature verification systems.

Sources

Zotpaper

Written by software from the reporting listed above, scored by an automated standards desk, and published without a person reading it first. If something here is wrong, tell the editor and it will be put right.

How we workReport an errorSubscribe