{"slug": "hypothetical-scenario-post-ai-cryptography", "title": "Hypothetical scenario; Post AI cryptography?", "summary": "In a pqc-forum discussion, Howard Y. Jung of Norma Co. claimed to have recovered a private key from an RSA-encrypted public key using a quantum simulator, utilizing 58 qubits and about 1 hour 54 minutes of computing time. The claim was posted in response to discussions about post-quantum cryptography and the vulnerability of RSA to Shor's algorithm, with Paul Wang of Morgan State University noting that Shor's algorithm reduces exponential computation to polynomial. The exchange also included Thomas' mention of a GPT-2 model fine-tuned on IACR eprint abstracts, which he doubted would design or break crypto soon.", "body_md": "--\n\nYou received this message because you are subscribed to the Google Groups \"pqc-forum\" group.\n\nTo unsubscribe from this group and stop receiving emails from it, send an email to[pqc-forum+...@list.nist.gov].\n\nTo view this discussion on the web visit[https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/9fcc9744-405c-4bc7-a9b3-6b222052a0cbn%40list.nist.gov].\n\nNo Problem Thomas,\n\n__ __\n\nSomeone already asked that question in ChatGPT:\n\nSure, here are a few cryptographic primitives that are believed to be resistant to attacks other than brute-force search through the keyspace, even when Grover's algorithm is taken into account:\n\nIt's worth noting that while these cryptographic primitives are currently believed to be secure against attacks other than brute-force search, future advancements in quantum computing or other areas of technology could potentially render them insecure. Therefore, it's important to regularly review and update the cryptographic primitives used to protect sensitive data to ensure that they remain secure in the face of new and emerging threats.\n\n__ __\n\n__ __\n\n__ __\n\nMet vriendelijke groet,\n\n__ __\n\nAd Koolen\n\nGovernment Crypto Specialist\n\n06 816 124 88\n\n__ __\n\nMob: + 31 681 612 488\n\nTo view this discussion on the web visit [https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/f57d9bb6-40d2-4d96-b2dd-b59c33ccfad2n%40list.nist.gov](https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/f57d9bb6-40d2-4d96-b2dd-b59c33ccfad2n%40list.nist.gov?utm_medium=email&utm_source=footer).\n\nAd,\n\nWith regarding to #3, it has been proven that factor-based asymmetric key encryption like RSA is vulnerable to Shor's algorithm which reduces the exponential computation to polynomial. This seems a better approach than using Grover's algorithm for an exhaust brute force search.\n\nPaul\n\n```\n-- \nShuangbao Wang, Ph.D. \nProfessor and Chair \nDepartment of Computer Science \nMorgan State University \nhttps://p-neumann.github.io/paul/\n443-885-4503/3962 \n\n\"Integrity, Intelligence, and Energy\"\n```\n\nTo view this discussion on the web visit[https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/002d01d94530%24ee0b3940%24ca21abc0%24%40compumatica.com].\n\nNice Thomas,\n\n__ __\n\nTxs for the update!\n\n__ __\n\nBtw, did you see this ?\n\n__ __\n\nI'm pleased to share the info with you how we have recovered the private key from the RSA-encrypted public key by using a quantum simulator.\n\nYou can find the detailed procedures from the URL below.[https://lnkd.in/emFgrUSP](https://lnkd.in/emFgrUSP)\n\nA total of 58 Qubit was utilized and the computing time consumed was ca. 1hr 54m.\n\nShould you have any queries in this regard, please feel free to email me at [how...@norma.co.kr], or [to...@norma.co.kr]\n\nIf any of you are visiting the MWC 2023 exhibition in Barcelona next week, I will be glad to meet and talk.\n\nYou can find our stand from the URL below.[https://lnkd.in/eGf6wB8K](https://lnkd.in/eGf6wB8K)\n\nWith best regards,\n\nHoward Y. Jung\n\n__ __\n\n__ __\n\nMet vriendelijke groet,\n\n__ __\n\nAd Koolen\n\n__ __\n\n__ __\n\nTo view this discussion on the web visit [https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/70eed5b2-51b0-4902-84f6-c3a4e48a5fa7n%40list.nist.gov](https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/70eed5b2-51b0-4902-84f6-c3a4e48a5fa7n%40list.nist.gov?utm_medium=email&utm_source=footer).\n\nIt’s a bit off topic but related. During Corona lockdown, I fine-tuned a GPT-2 instance on all IACR eprint abstracts as hobby project:\n\n__ __\n\nThe tool can write a new abstract, write the abstract to a given title, or complete Title + partial abstract.\n\n__ __\n\nIt also knows a bit about PQC. However, similar to a lot of GPT related systems – some of the text sounds good but is not necessarily correct or useful. I have\nmy doubts that these systems will design or break crypto in the near future. __\n__\n\n__ __\n\nCheers\n\nThomas\n\n__ __\n\n__ __\n\n**From:** 'Bas Westerbaan' via pqc-forum <[pqc-...@list.nist.gov]>\n\n**Sent:** Montag, 20. Februar 2023 02:52\n\n**To:** Doge Protocol <[dogepr...@gmail.com]>\n\n**Cc:** pqc-forum <[pqc-...@list.nist.gov]>\n\n**Subject:** Re: [pqc-forum] Hypothetical scenario; Post AI cryptography?\n\n__ __\n\n|\n|\n\n__ __\n\nTo view this discussion on the web visit [\nhttps://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/CAMjbhoXRdDapx6yhSgVX7-_f625RGS8c8r%3DcKpkdvVT9EhgmEA%40mail.gmail.com](https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/CAMjbhoXRdDapx6yhSgVX7-_f625RGS8c8r%3DcKpkdvVT9EhgmEA%40mail.gmail.com?utm_medium=email&utm_source=footer).\n\nTL;DR: My intuition is that AI/ML-assisted cryptanalysis will accelerate the pace of discovering new better factoring and lattice-reduction algorithms, but there’s\nnothing fundamentally new about the algorithms discovered by ML-assisted research methods that would invalidate our current security proofs.\n\n__ __\n\nAI/ML is able to make astounding progress on problems such as human genetics or drug discovery, but keep in mind that the human genome is 725 mb and there are tens\nof millions of known organic compounds, whereas the key space of AES-256 is like 10^66 TB – more than the number of atoms on earth (estimated at 10^50). So unless we’ve thoroughly goofed in designing our permutation functions, you would need more input-output\npairs in the “training data” than there are atoms on the planet. So I’m skeptical that AI/ML could break modern ciphers with substantially less computational resources than the brute-force method of building a lookup table.\n\n__ __\n\n__ __\n\nI like to de-magic things be replacing the terms “AI / ML” with the term “computational statistics”. So then the question becomes “Can large-scale computational\nstatistics do a better job at cryptanalysis than contemporary approaches?”. But of course computational statistics has been in the cryptanalysis toolbox since the days of Claude Shannon and Alan Turing, so it’s not fundamentally new; Claude Shannon coined\nthe terms “confusion and diffusion” as cipher design principles exactly to counter this sort of statistical cryptanalysis.\n\n__ __\n\n__ __\n\nNow to AI/ML-assisted research methods. This is bearing fruit in medical research where, for example, an AI/ML can evaluate vast numbers of chemical compounds for\nones that may behave similarly to existing pharmaceuticals, leaving researchers with a short-list of compounds to investigate manually. I imagine a similar technique could be used to discover, for example, lattice reduction algorithms, but there’s nothing\nfundamentally new about the classes of algorithms that an AI would discover, including statistical methods (ie the lattice-reduction alg is itself AI/ML), so they would have to obey bounds established in our current security proofs.\n\n__ __\n\n---\n\n**Mike** Ounsworth\n\n__ __\n\n**From:** [pqc-...@list.nist.gov] <[pqc-...@list.nist.gov]>\n**On Behalf Of **[Thomas.Po...@infineon.com]\n\n**Sent:** Monday, February 20, 2023 12:36 PM\n\n**To:** [b...@cloudflare.com]; [dogepr...@gmail.com]\n\n**Cc:** [pqc-...@list.nist.gov]\n\n**Subject:** [EXTERNAL] RE: [pqc-forum] Hypothetical scenario; Post AI cryptography?\n\n__ __\n\nWARNING: This email originated outside of Entrust.\n\nDO NOT CLICK links or attachments unless you trust the sender and know the content is safe.\n\n.\n\nTo view this discussion on the web visit [https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/59204bcfef01486b9c2ecf0a45670165%40infineon.com](https://urldefense.com/v3/__https:/groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/59204bcfef01486b9c2ecf0a45670165*40infineon.com?utm_medium=email&utm_source=footer__;JQ!!FJ-Y8qCqXTj2!bQeVXAH4kr0yvzUp8itAUVGJgCZJz8W2NVsW0dGgPRNCWBSItTWU688eV01GEQSYlgL43qy7seH9EHJj73lhz-_I49KaJ1WaPQ$).\n\n--\n\nYou received this message because you are subscribed to the Google Groups \"pqc-forum\" group.\n\nTo unsubscribe from this group and stop receiving emails from it, send an email to[pqc-forum+...@list.nist.gov].\n\nTo view this discussion on the web visit[https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/83633dc9-c364-45a6-9b83-a304d25f650fn%40list.nist.gov].\n\nTo view this discussion on the web visit[https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/98A1D61A-B759-407E-93BD-3F3D5B1556D5%40gmail.com].\n\nTo view this discussion visit[https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/a1077607-892e-466e-b8b6-0b2dc971705dn%40list.nist.gov].\n\nTo view this discussion visit[https://groups.google.com/a/list.nist.gov/d/msgid/pqc-forum/CAPxHsSKP6bR6e5U2F%2BxEog42O18HeTuD%2B%2Bb%3DZkb1Y0FGcgEHsQ%40mail.gmail.com].\n\n|\n⚠️ |", "url": "https://wpnews.pro/news/hypothetical-scenario-post-ai-cryptography", "canonical_source": "https://groups.google.com/a/list.nist.gov/g/pqc-forum/c/w4o-VCza_so", "published_at": "2026-08-03 14:14:16+00:00", "updated_at": "2026-08-03 14:22:46.353741+00:00", "lang": "en", "topics": ["artificial-intelligence", "large-language-models", "ai-research"], "entities": ["Howard Y. Jung", "Norma Co.", "Paul Wang", "Morgan State University", "Thomas", "GPT-2", "IACR", "RSA"], "alternates": {"html": "https://wpnews.pro/news/hypothetical-scenario-post-ai-cryptography", "markdown": "https://wpnews.pro/news/hypothetical-scenario-post-ai-cryptography.md", "text": "https://wpnews.pro/news/hypothetical-scenario-post-ai-cryptography.txt", "jsonld": "https://wpnews.pro/news/hypothetical-scenario-post-ai-cryptography.jsonld"}}