New RSA Encryption Vulnerability Discovered
Classical computing method reduces RSA security levels significantly.
1RSA security breakthrough
Researchers have discovered a new method to break RSA encryption without factoring large numbers, challenging long-held security assumptions. The technique, called signature forgery, significantly reduces the computational resources needed compared to traditional factoring methods. This breakthrough was achieved using classical computing, without employing quantum computing or AI acceleration. The research team, including UC San Diego professor Nadia Heninger, demonstrated the attack on 1024-bit RSA keys in just months using academic computing resources.
2Security level reductions
The forgery attack dramatically lowers RSA's effective security levels from theoretical standards. For 1024-bit keys, security drops from 2**128 to just 2**65 operations required. Similarly, 2048-bit keys fall to 2**90 and 4096-bit to 2**119, all below the 128-bit minimum recommended by security agencies. These reductions occur because the attack bypasses the need to factor large numbers entirely. The researchers achieved these results using manual coding without GPU acceleration, suggesting further improvements are possible with optimized implementations.
3Limited but significant risk
While the immediate practical risk is limited to deprecated 1024-bit implementations, the theoretical implications are profound. The attack specifically targets 'textbook RSA' or blind-signature implementations still used in some systems. Cryptography expert Karsten Nohl notes this could represent a conceptual breakthrough if verified. The research demonstrates that RSA's security may not be equivalent to factoring difficulty as previously believed, potentially undermining trust in the algorithm during the ongoing post-quantum transition period.
4Implementation vulnerabilities
The attack exploits specific implementation choices in RSA rather than a fundamental mathematical weakness. It works against systems using 'textbook RSA' or blind signatures, where the signer doesn't see the actual message being signed. Many modern RSA implementations include protections against such attacks, but legacy systems may remain vulnerable. The researchers emphasize that properly implemented RSA with appropriate padding remains secure against this specific attack vector.
5Computational requirements
The research team demonstrated the attack on 1024-bit keys using an academic CPU cluster over several months. This represents orders of magnitude less resources than traditional factoring would require for similar keys. Notably, the attack didn't use specialized hardware like GPUs or AI acceleration, suggesting potential for further optimization. The researchers predict these tools would 'almost certainly' reduce security levels further, though they haven't yet quantified the potential improvements.
6Industry standards impact
The findings challenge current security standards from agencies like NSA, NIST, and ENISA that mandate minimum security levels. The attack reduces RSA's effective security below these thresholds for all key sizes tested. This comes during a sensitive transition period as organizations prepare for post-quantum cryptography. While not immediately catastrophic, the discovery adds urgency to migration plans and may accelerate deprecation of older RSA implementations in favor of quantum-resistant algorithms.
7Research methodology
The team conducted their research using classical computing methods without quantum or AI assistance. They focused on the mathematical properties of RSA signatures rather than brute-force attacks. Their approach identifies a previously unknown gap in security assumptions about RSA's relationship to factoring difficulty. The paper provides cryptanalytic evidence suggesting the need to move away from RSA entirely, though the researchers acknowledge current implementations with proper padding remain secure against their specific attack vector.
8Cryptographic implications
This discovery represents a significant development in cryptanalysis, even if immediate risks are limited. It demonstrates that RSA's security may not be fundamentally tied to factoring difficulty as previously thought. The research adds to growing concerns about RSA's long-term viability during the post-quantum transition. While not rendering RSA obsolete overnight, it provides additional motivation for organizations to accelerate their migration to quantum-resistant cryptographic standards and phase out vulnerable implementations.
Original article: Slashdot — New RSA Encryption Vulnerability Discovered