Researchers Bypass RSA Encryption Without Factoring the Key

Researchers have developed a new technique to bypass 1,024-bit RSA encryption without factoring the key, a method long considered the primary threat to RSA security. The discovery raises significant concerns about the long-term viability of RSA encryption, even for larger key sizes like 2,048-bit and 4,096-bit.

New Technique Bypasses RSA Encryption Without Factoring

Researchers from the University of California, San Diego and Inria Nancy have developed a method to bypass 1,024-bit RSA encryption without factoring the key, a process long considered the primary threat to RSA security. According to Gizmodo, the technique required 1,380 CPU core-years of computational power over five months, a fraction of the 500,000 to 1 million CPU core-years previously estimated to break such encryption.

The attack leverages a variant of the number field sieve algorithm, first proposed in 2007. While it does not factor the RSA key, it exposes vulnerabilities in certain implementations of the encryption standard.

Security Implications for Larger RSA Keys

The new technique has broader implications for RSA encryption as a whole. According to Gizmodo, the method reduces the security of even 2,048-bit and 4,096-bit RSA keys to levels considered unacceptably low by standards set by the National Institute of Standards and Technology (NIST), the National Security Agency (NSA), and the European Union’s cybersecurity agencies.

This development aligns with NIST’s existing roadmap to deprecate RSA by 2030 and eliminate its use by the mid-2030s. The agency has been advocating for a transition to quantum-resistant encryption methods in anticipation of future threats, including advances in quantum computing.

Limitations and Resistance

Not all RSA implementations are vulnerable to this attack. According to Gizmodo, the technique is ineffective against RSA implementations that use PKCS#1 v1.5 or PSS padding. This suggests that certain deployments of RSA may still offer robust security if properly configured.

For example, an attack on a 2,048-bit RSA implementation used by companies like Apple or Cloudflare would require a volume of requests equivalent to Cloudflare’s daily HTTP traffic, making large-scale exploitation impractical in some cases.

Quantum Computing Looms as a Long-Term Threat

While the new attack raises immediate concerns, the long-term viability of RSA is also threatened by the potential of quantum computing. According to Gizmodo, RSA is not quantum-resistant, meaning encrypted data using current RSA standards could be decrypted in the future by attackers with access to quantum computers.

Although quantum computers capable of breaking RSA at scale remain theoretical, research and development in this area are progressing rapidly. This further underscores the urgency for organizations to adopt encryption methods resistant to both classical and quantum attacks.

Background on RSA Encryption

RSA encryption, named after its inventors Rivest, Shamir, and Adleman, has been a cornerstone of digital security since the 1970s. It relies on the mathematical difficulty of factoring large integers to secure data transmission and authentication. For decades, breaking RSA has been synonymous with solving this factoring problem, which was believed to require impractical amounts of computational power for larger key sizes.

Over time, advances in computing and algorithmic techniques have gradually eroded the security margins of smaller RSA keys. The introduction of 1,024-bit keys was once considered secure, but increasing computational power and improvements in mathematical techniques have rendered them obsolete for sensitive applications. Larger keys, such as 2,048-bit and 4,096-bit, were adopted to maintain security, though their long-term resilience has always been contingent on the absence of breakthroughs in cryptanalysis.

What this means

LazyFounders analysis — our interpretation, not reported fact.

This research is a wake-up call for organizations still relying on RSA encryption, particularly for sensitive or long-term data security. While the attack requires significant computational resources, it demonstrates that RSA’s security guarantees are weaker than previously assumed—even without factoring the key.

For founders and operators, this development reinforces the importance of proactive cryptographic agility. Transitioning to quantum-resistant encryption methods isn’t just a theoretical exercise for the distant future; it’s a near-term necessity. Companies should audit their encryption protocols, identify dependencies on RSA, and prioritize migration plans to avoid last-minute scrambles as deadlines like NIST’s 2030 deprecation date approach.

The fact that RSA implementations using PKCS#1 v1.5 or PSS padding remain resistant to this attack also highlights the value of proper configuration. However, this should not be a reason for complacency. The broader trend is clear: RSA’s days as a gold standard for encryption are numbered, and the time to act is now.

Key takeaways

• 1,024-bit RSA encryption can now be bypassed without factoring the key, a method previously considered secure.
• The attack required significant computational resources but was far less demanding than earlier estimates for breaking RSA.
• Larger RSA keys (2,048-bit and 4,096-bit) are also vulnerable, raising concerns about long-term security standards.
• RSA implementations using PKCS#1 v1.5 or PSS padding appear resistant to this specific attack.
• Organizations relying on RSA should accelerate plans to transition to quantum-resistant encryption methods.

FAQ

What is RSA encryption, and why is it important?

RSA encryption is a widely used public-key cryptographic system that secures data transmission and authentication. It relies on the mathematical difficulty of factoring large integers, which has made it a foundational tool for digital security since the 1970s.

How does this new attack work?

The attack bypasses RSA encryption without factoring the key, using a variant of the number field sieve algorithm. It required 1,380 CPU core-years of computational power, significantly less than the previously estimated 500,000 to 1 million CPU core-years needed to break 1,024-bit RSA.

Are all RSA implementations vulnerable to this attack?

No. The technique is ineffective against RSA implementations that use PKCS#1 v1.5 or PSS padding. Properly configured RSA deployments may still offer robust security.

What should organizations do in response to this research?

Organizations should audit their encryption protocols, identify dependencies on RSA, and accelerate plans to transition to quantum-resistant encryption methods. NIST’s roadmap to deprecate RSA by 2030 makes this a near-term priority.

Is quantum computing a threat to RSA encryption?

Yes. RSA is not quantum-resistant, meaning future quantum computers could break it. While large-scale quantum computers remain theoretical, their development is progressing, making the transition to quantum-resistant encryption urgent.

Related on LazyFounders

• Apple
• Cloudflare
• More technology news