There's a new way to break RSA that's faster than anything we've seen before

* A novel method exists that uses classical computing to reduce RSA security levels.
* The method allows for signature forgery without factoring RSA keys.
* Applying the attack against 1024-bit keys took a handful of months on an academic CPU cluster.
* This process requires significantly fewer resources than current estimates suggest for 1024-bit factoring.
* The method is practical for 1024-bit RSA and reduces security for 2048-bit and 4096-bit keys to unacceptable levels.
* Cryptographers previously thought breaking RSA required factoring the private key.
* The National Security Agency, NIST, and EU require cryptosystems to provide at least 128 bits of security (exceeding 2128 operations).
* Computational estimates show that a large GPU cluster could complete the necessary computation in hours.
* A cluster with 4,000 GPUs could finish this computation in 6–12 hours.
* Energy usage for computation is estimated between 30 and 60 MWh for a GPU cluster running for 6-12 hours.

The narrative presents a shift in the fundamental understanding of cryptographic security, moving from reliance on computational hardness (factoring) to exploiting systemic flaws in signature verification directly. The core implication is that perceived mathematical complexity does not equate to true security if alternative algorithmic pathways exist. The progression highlights a widening gap between theoretical cryptographic strength and practical implementable attacks, especially when resource constraints are introduced—or deliberately circumvented. This creates a tension between the idealized mathematical safety of systems and their real-world vulnerability under current computational realities. The mention of specific operational costs (core-years, GPU clusters, energy consumption) anchors the abstract threat in tangible, accessible metrics, suggesting that this is not purely theoretical but an immediately scalable vector for risk assessment. The lingering question concerns the timeline for widespread adoption of countermeasures versus the potential for retrospective vulnerability exposure across existing systems built on older key lengths.
Bridge Questions: If signature forgery is practical using classical computing, what immediate and systemic shifts are required in regulatory and deployment standards to address this new class of attacks? How should institutions prioritize defense when theoretical security models are proven insufficient by novel algorithmic breakthroughs? What oversight mechanisms can be established to track the provenance and mitigation timeline for such fundamental cryptographic research?