Researchers find new classical method to break RSA without factoring keys

New research describes a classical-computing attack that breaks RSA through signature forgery rather than factoring, reducing required resources by orders of magnitude. Cryptographers say it poses little immediate threat to widely used implementations; attacking even deprecated 1024-bit keys would still require nation-state-level compute. Expert Karsten Nohl said peer review could confirm a conceptual breakthrough.