{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreif7jj2we7of53qgn45opnupjdx2n2rsf7rwaesewoyxe7ktrmlqva",
    "uri": "at://did:plc:haakkg7y3xdghcdmprxeexso/app.bsky.feed.post/3mj63nvddigi2"
  },
  "path": "/t/a-cryptography-engineer-s-perspective-on-quantum-computing-timelines/37010#post_11",
  "publishedAt": "2026-04-10T17:32:46.000Z",
  "site": "https://discuss.privacyguides.net",
  "textContent": "If a quantum computer becomes stable enough to break RSA-2048, it means the hardest problem (fault-tolerant scaling) has been largely solved. From that point, the gap to attacking AES-128 is no longer about feasibility, but about efficiency. While AES-128 wouldn’t fall immediately, it would move from “theoretical concern” to “practical target,” because the remaining challenges are engineering optimizations rather than fundamental barriers.",
  "title": "A Cryptography Engineer’s Perspective on Quantum Computing Timelines"
}