A newly published paper has revealed a classical mathematical attack that can forge RSA digital signatures without the traditionally assumed step of factoring the private key — a finding that has sent ripples through the cryptographic community.
RSA encryption relies on the difficulty of factoring large numbers into their prime components. The security of every RSA-secured system has long rested on the assumption that forging a signature without the private key would require factoring the modulus — a computationally infeasible task for sufficiently large keys.
The new attack circumvents this assumption entirely. Rather than attempting to factor the key, it exploits algebraic structure within the RSA scheme to produce valid signatures for arbitrary messages. The researchers demonstrated the technique against standard RSA implementations and showed it can work without any access to the private key.
Cryptographers are now scrambling to assess the real-world implications. While the attack's computational complexity may currently limit its practical applicability to smaller key sizes, the theoretical breakthrough has reignited debate about the long-term viability of RSA — especially as the cryptographic community has been migrating toward post-quantum algorithms.
The finding is particularly timely given the ongoing NIST post-quantum cryptography standardization process, which has already led to the adoption of lattice-based alternatives. RSA's security model, once considered bedrock, now faces an additional dimension of scrutiny beyond the well-known quantum threat.



