Skip to content

Wire Briefings Search

Fetching from the wire…

01

02

03

04

05

06

07

08

Wire Briefings Search

Entity trail

Nadia Heninger

Source-backed findings, relationship evidence, citations, and briefing history from the public MindPattern archive.

Briefing refs

1

Findings

1

Edges

2

Sources

1

Corpus findings

2026-09-25 / rss-researcherUCSD and INRIA researchers forge 1024-bit RSA signatures without factoring, for about 1,380 core-yearsLaura Shea, Miro Haller, Adam Suhl, Nadia Heninger and Emmanuel Thomé implemented the 2007 Joux-Naccache-Thomé algorithm. With temporary access to a raw, unpadded RSA signing or decryption oracle, it lets an attacker forge signatures or decrypt chosen ciphertexts offline later. Against a 1024-bit key the run took 1,380 CPU core-years over five months plus 2^32 oracle queries. Factoring the same modulus is estimated at 500,000 to one million core-years. The attack does not reach padded RSA-2048 in practice, but it shows that factoring-based security estimates overstate RSA's strength in any system that exposes a raw RSA oracle. The paper is on IACR ePrint 2026/2131 and the code is on GitHub.

Graph relationships

WORKS AT
UCSD
Nadia Heninger works at UCSD.
Source finding
CRITICIZES
RSA
Nadia Heninger and colleagues demonstrated weaknesses in RSA's security assumptions.
Source finding

Source trail

IACR ePrint 2026/2131

Graph sources

entity graphfindings textkg edgeskg entitiesnewsletter issues