Cryptographic researchers have published a method that can forge 1024-bit RSA signatures in a time frame approaching that of the Special Number Field Sieve (SNFS). The attack targets the underlying mathematical structure of RSA, exploiting weaknesses that reduce the security margin of widely used signature schemes.

What You Need to Know

The attack does not break RSA encryption entirely but focuses on signature forgery, which has direct implications for digital trust systems. It leverages a technique that brings the computational workload closer to the speed of the highly efficient SNFS algorithm. While still requiring significant resources, the advance narrows the gap between theoretical feasibility and practical execution for 1024-bit keys.

How the Attack Works

The researchers exploit a specific property of the RSA signature scheme that allows for a more efficient mathematical reduction. Instead of factoring the modulus directly, the forgery method transforms the signature generation problem into a discrete logarithm calculation, which can then be attacked using SNFS-like techniques.

  • Key technique: The attack uses a lattice-based method to find a short vector that corresponds to a forged signature.
  • Approximate speed: The forgery completes in a time that is polynomially close to the runtime of the SNFS, which is the fastest known algorithm for factoring numbers with special structure.
  • Key size impact: The method is most effective against 1024-bit RSA, a key length that remains in widespread legacy use despite recommendations to migrate to 2048-bit or larger.

Industry Implications

The advance does not pose an immediate threat to well-implemented systems using 2048-bit or higher keys. However, the practicality of forging signatures on 1024-bit keys could erode trust in older digital certificates and signed software. Organizations still relying on 1024-bit RSA for code signing or TLS certificates may need to accelerate migration plans.

The attack also highlights a broader trend in cryptanalysis: the continuous refinement of techniques that bring theoretically known attacks closer to practical reality. Many existing security protocols assume a comfortable margin between current computational limits and feasible attacks. This work suggests that margin may be shrinking faster than previously modeled for certain key sizes.

Why This Matters

The direct consequence is that digital signatures created with 1024-bit RSA keys may no longer provide the long-term assurance that many organizations rely on. Certificates issued years ago with such keys could become vulnerable to forgery, especially if an attacker can obtain a targeted sample of signatures. This is particularly relevant for embedded systems, IoT devices, and legacy software where key upgrades are difficult.

Longer term, the research pushes the cryptographic community to reduce thresholds for acceptable key sizes and to accelerate adoption of post-quantum signature schemes. While the paper is an academic advance, its proximity to the SNFS benchmark makes it a milestone in understanding the true security of RSA-based systems.