Researchers have discovered a novel method to forge RSA signatures using classical computing without factoring the key, reducing security to unacceptable levels. The attack is practical against 1024-bit keys and significantly reduces computational requirements compared to traditional factoring approaches, though widely used implementations remain safe.
Researchers have discovered a novel classical computing attack on RSA that enables signature forgery without factoring, reducing computational requirements by orders of magnitude. The attack is now practical for 1024-bit keys and significantly weakens 2048-bit and 4096-bit RSA security, though widely used implementations remain safe for now.
Researchers have discovered a novel classical computing attack on RSA that enables signature forgery without factoring keys, reducing computational requirements by orders of magnitude. While immediately impractical against widely-deployed implementations, the method brings 1024-bit RSA attacks into feasibility and degrades security of larger keys below acceptable thresholds.