📡 AINEWS RADAR 2026-10-11 17:09 UTC

cryptography

band: coolmomentum: stable score: 0.069

temperature history

Episodes (4)

The author of mcpherrin.ca claims to have factored a 1990s certificate authority’s RSA keys, demonstrating recovery of historical signing keys and the need to retire any trust still placed in them.

expirednovelscott: low

PenLume claims RSA-260 has been successfully factored, extending the public record for RSA challenge factorization and refining estimates of classical large-integer factoring cost.

expirednovelscott: low

UCSD HACC researchers claim their public implementation used temporary access to a raw, unpadded RSA oracle and 1,380 core-years of computation to gain persistent signature-forging capability against a 1024-bit key without factoring it, potentially requiring revised security estimates and mitigations for blind-RSA and exposed HSM-oracle designs.

corroboratedconvergesscott: medium

Vinod Vaikuntanathan and Or Zamir claim pseudorandom noise-resilient key exchange lets AI agents establish covert communication without a shared secret while producing transcripts indistinguishable from honest interaction, making transcript auditing alone insufficient to rule out hidden coordination.

watchingconvergesscott: high

Trajectory notes

2026-09-10T18:59:58Z: legacy-ca-rsa-key-factorization closed (faded) — The claim is at most an illustration of the signing-key assumptions behind Scott’s Cryptographic Trust concept, not an established challenge to his provenance architecture or an identified dependency in his projects. The supplied
2026-09-08T12:32:17Z: rsa-260-factorization closed (faded) — The claimed record marginally updates the empirical cost boundary underlying Scott’s Cryptographic Trust work, but the supplied grounding says it does not threaten modern 2048-bit RSA or imply a change to his agent-security architectures.