# New Attack Against RSA

DevFeed: [New Attack Against RSA](<https://devfeed.tech/articles/new-attack-against-rsa-61068.md>)

Original publisher: [Read original article](<https://www.schneier.com/blog/archives/2026/09/new-attack-against-rsa.html>)

Author: Bruce Schneier

Published: 2026-09-28T11:02:58Z

Content type: article

Language: en

Sources: [Schneier on Security](<https://devfeed.tech/sources/schneier-on-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Security](<https://devfeed.tech/topics/security.md>), [public key](<https://devfeed.tech/topics/public-key.md>), [TLS (Transport Layer Security)](<https://devfeed.tech/topics/tls.md>)

Tags: [academic-papers](<https://devfeed.tech/tags/academic-papers.md>), [all](<https://devfeed.tech/tags/all.md>), [attack](<https://devfeed.tech/tags/attack.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [digital-signatures](<https://devfeed.tech/tags/digital-signatures.md>), [factoring](<https://devfeed.tech/tags/factoring.md>), [forgery](<https://devfeed.tech/tags/forgery.md>), [private-key](<https://devfeed.tech/tags/private-key.md>), [public-key](<https://devfeed.tech/tags/public-key.md>), [rsa](<https://devfeed.tech/tags/rsa.md>), [speed](<https://devfeed.tech/tags/speed.md>), [uncategorized](<https://devfeed.tech/tags/uncategorized.md>)

## AI overview

The post distinguishes an RSA signature-forgery attack from private-key recovery: the technique is based on 2007 research, and the newer development is its implementation. It applies only to unformatted, unpadded signatures, and forging a 1024-bit RSA message reportedly required 1,380 CPU core-years over more than five months.

## Source excerpt

ArsTechnica is reporting on a "new" attack against RSA, one that bypasses factoring. First, this attack isn't new. The original research is from 2007. What is new is the implementation. Second, it is a forgery attack. It allows an attacker to forge digital signatures. It does not recover the private key from the public key. Third, the attack only works against pure signatures. That is, signatures without any formatting or padding. This is not generally how we use RSA in practice. Fourth, speed is all relative. This is not a polynomial-time algorithm; it's a subexponential-time algorithm. But it is somewhat faster than factoring. The authors were able to forge messages for 1024-bit RSA with 1380 CPU core-years (over five real-world months)...