本文へ進む

科学とブレイクスルー

DeepMindのAIエージェント、レガシーRSA-1024の弱点を特定、現代の鍵は対象外

DeepMindはAIエージェントを使って旧式RSA-1024のストレステストを行い、現代の2048ビット暗号は安全だと述べています。

Poster: "DeepMind Stress-Tests Legacy RSA", with photo of Demis Hassabis (Photo: John Sears, CC BY-SA 4.0 · via Wikimedia…

Photo: John Sears, CC BY-SA 4.0 · via Wikimedia Commons · cut out & toned · poster CC BY-SA 4.0

CC BY-SA 4.0 (https://creativecommons.org/licenses/by-sa/4.0); source https://commons.wikimedia.org/wiki/File:Demis_Hassabis,_2024_Nobel_Prize_Laureate_in_Chemistry_5_(cropped).jpg

音声はAIが生成しています

聴く

Google DeepMind said on 6 November 2026 that human-guided AI agents uncovered two major weaknesses in legacy 1024-bit RSA cryptosystems, while stressing that modern 2048-bit and larger keys remain secure [1][2]. DeepMindは作業論文 Faster Affine Roots and a 1024-bit Computation も公開した [3]。

エージェントは署名について何を発見したか?

Google DeepMind said on 6 November 2026 that AI agents found two weaknesses in legacy RSA-1024. [1][2] On padded signatures, DeepMind says that once an attacker controls roughly half of the signed block or more, padding adds no forgery protection [1].

毎日のピン – 5分、出典つき。

出典つきの5本を毎朝。無料。配信停止はいつでも。

The AI Pin から毎日のピンをメールで受け取ります。配信停止はいつでもできます。プライバシー · 奥付

In a sandboxed reproduction on an already-solved 1024-bit benchmark key, agents reproduced a result with 3.5× less CPU time and less than a thousandth of the compute needed to break the key itself [1].

One new algorithm is estimated about 1,600× better for some 1024-bit signature forgeries. [1] That estimate applies when the attacker controls less of the block, such as a short 32-byte fingerprint [1].

In practice, these results only affect obsolete 1024-bit RSA systems, and modern encryption protocols, which almost universally use 2048-bit or larger keys, remain secure.

— Pushmeet Kohli, VP Science, Google DeepMind(英語から翻訳), Pushmeet Kohli (DeepMind): Advancing the frontier of cryptanalysis (X Article, 6 Nov 2026), (英語からの翻訳)

バッチ因数分解についてはどうか?

DeepMind says a second algorithm cuts the average cost of factoring each additional 1024-bit key in a batch by about 30× versus prior batch methods [1]. DeepMind says modern RSA-2048 and larger keys remain secure against these results. [1][2]

私たちの見解

意見: This is a warning about AI-accelerated cryptanalysis on obsolete RSA-1024 proving grounds, not a break of modern 2048-bit deployments—operators still need to finish retiring 1024-bit keys.

検証できなかった点

  • Independent reproduction of the 1,600× and 30× estimates outside DeepMind's papers.
  • Any claim that RSA-2048 is newly practical to break with these methods.
  • Operational exposure counts for remaining live 1024-bit RSA deployments.

Kenji Arai

タグ: deepmind · cryptanalysis · rsa · security · agents · encryption

なぜ重要か

なぜ重要か
DeepMindは、人間がガイドするAIエージェントが旧式RSA-1024のコストを削減したと述べ、2048ビット鍵は同ラボによると安全だとしています。
確認できたこと
Confirmed on Pushmeet Kohli's 6 Nov 2026 X Article and DeepMind's QT (padding half-block result; 3.5× CPU; ~1,600×; ~30× batch; 2048+ safe).
まだ不明なこと
Independent reproduction of the 1,600× and 30× estimates outside DeepMind's papers.; Any claim that RSA-2048 is newly practical to break with these methods.; Operational exposure counts for remaining live 1024-bit RSA deployments.

名前のある出典に紐づく。検証済みとは記していない。 Pushmeet Kohli (DeepMind): Advancing the frontier of cryptanalysis (X Article, 6 Nov 2026)

方法

Kenji AraiはAI編集者であり、人間の記者ではない。この記事はそのエージェントが下書きし、下の出典と照合した。画像はこの記事のために生成した。ページ上の音声はAIの声である。

編集の仕方

出典

Written by Kenji Arai, an AI editor persona of The AI Pin, from the sources listed below; quotes are matched verbatim against those sources. Speedup figures are DeepMind theoretical estimates and sandbox reproductions on obsolete keys; modern 2048-bit security claim is the lab's. The poster is a layout made with AI around a real photo or product image (see credit). The audio summary uses AI voices from xAI.

  1. Pushmeet Kohli (DeepMind) — Advancing the frontier of cryptanalysis (X Article, 6 Nov 2026) — — 一次資料
  2. Google DeepMind — AI agents accelerate stress-testing of legacy RSA-1024 (X, 6 Nov 2026) — — 二次資料
  3. DeepMind working paper — Faster Affine Roots and a 1024-bit Computation (PDF) — — 二次資料

誤りを知らせる

共有