返回资讯中心
外部精选
芯片&算力
#评测#基础设施#Biz & IT#Security#cryptanalysis#factoring

There's a new way to break RSA that's faster than anything we've seen before

Until now, cryptographers thought factoring was the only way to break RSA. Not anymore.

Ars Technica Dan Goodin 2026/9/24 · 2026/9/243 分钟阅读

以下正文同步自 Ars Technica,版权归原站所有,已转换为易读排版。

The world has known for decades that the RSA cryptosystem’s days are numbered. Once quantum computing becomes practical (estimates for that range from 3 to 20 or more years), the foundational security it provides will crumble. New research has revealed a novel method that uses classical computing to reduce the current RSA security level to an unacceptably low threshold. The finding poses little to no practical threat in the immediate term, except possibly in a few edge cases. Even applying the attack against the deprecated use of 1024-bit keys, the method requires more computation than just about anybody—short of nation-states or companies with massive resources—can achieve. Widely used RSA implementations are also safe. Nonetheless, the research has taken cryptographers by surprise because it introduces signature forgery, a new way to break RSA keys without factoring. Equally important, this novel method reduces the required computing resources by orders of magnitude. Read full article Comments

正文由 探How 从来源站点 RSS 同步,内容未经改写;遇到排版缺失或需要图片、视频时请以原文为准。

打开原文
去社区讨论 →