RC RANDOM CHAOS

New RSA Attack Implementation Bypasses Factoring

· via Schneier on Security

Original source

New Attack Against RSA

Schneier on Security →

A new implementation of a 2007 attack against RSA allows forgery of digital signatures without recovering private keys. The attack, however, only works against pure signatures without formatting or padding, which is not typical in practice. While faster than factoring, it remains a subexponential-time algorithm, demonstrated by forging 1024-bit RSA signatures using 1380 CPU core-years.

Read the full article

Continue reading at Schneier on Security →

This is an AI-generated summary. Read the original for the full story.