{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreih3bvh4n2zuqaszvbbcprsy6qp5v75m44nwpwgzpsmdzg2n22652u",
    "uri": "at://did:plc:haakkg7y3xdghcdmprxeexso/app.bsky.feed.post/3ml4glba7gr62"
  },
  "path": "/t/what-is-quantum-encryption-how-does-it-work/37644#post_2",
  "publishedAt": "2026-05-05T14:19:22.000Z",
  "site": "https://discuss.privacyguides.net",
  "tags": [
    "en.wikipedia.org",
    "Post-quantum cryptography"
  ],
  "textContent": "en.wikipedia.org\n\n### Post-quantum cryptography\n\nPost-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key algorithms) that are currently thought, but not proven, to be secure against a cryptanalytic attack by a quantum computer. Most widely used public-key algorithms rely on the difficulty of one of three mathematical problems: the integer factorization problem, the discrete logarithm problem, or the elliptic-curve discrete As...\n\nUnfortunately the proper explanation involves some high level mathematics .. and I definitely don’t understand that myself either.\n\nIn short: Quantum computers are really good at calculating some things that take traditional computers _much_ longer. This can be an issue for _some_ encryption algorithms.\nThere are ways to change these algorithms so that Quantum computers are losing their speed advantage and that’s what post-quantum cryptography is all about.",
  "title": "What is Quantum Encryption? How does it work?"
}