{"id":1160273,"date":"2026-11-02T12:22:21","date_gmt":"2026-11-02T12:22:21","guid":{"rendered":"https:\/\/www.europesays.com\/us\/1160273\/"},"modified":"2026-11-02T12:22:21","modified_gmt":"2026-11-02T12:22:21","slug":"alice-bob-sets-record-low-for-quantum-resources-required-to-break-internet-encryption","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/us\/1160273\/","title":{"rendered":"Alice &#038; Bob Sets Record Low for Quantum Resources Required to Break Internet Encryption"},"content":{"rendered":"<p>\t\t\t\t<img loading=\"lazy\" decoding=\"async\" class=\"\" src=\"https:\/\/alice-bob.com\/wp-content\/uploads\/2026\/04\/AB-logo-RVB-horizontal-black-2.png\" alt=\"Alice &amp; Bob Unveils Refined Brand Identity - Alice &amp; Bob\" width=\"229\" height=\"76\"\/><br \/>\n <strong>23K physical qubits running for 3 days could break RSA-2048, which secures internet encryption. 30K physical qubits could crack a Bitcoin key in about 1 hour<\/strong><\/p>\n<p><a href=\"https:\/\/alice-bob.com\/\" target=\"_blank\" rel=\"noopener nofollow\">Alice &amp; Bob,<\/a> a leader in fault-tolerant quantum computing, sets a record low for the total quantum resources (qubits multiplied by runtime) required to run Shor\u2019s algorithm on today\u2019s encryption. Its cat-qubit architecture needs 40 times fewer physical qubits than Google Quantum AI\u2019s Craig Gidney 2025 estimate to break RSA-2048 (arxiv).<\/p>\n<blockquote>\n<p>For anyone keeping track of how soon the threat from quantum computers becomes real \u2013 this is an important paper.\u201d<\/p>\n<p>\u2014 Prof. Antoine Joux, specialist in cryptanalysis and G\u00f6del Prize laureate<\/p>\n<\/blockquote>\n<p>In the paper \u201cShor\u2019s algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days\u201d (IACR ePrint) researchers estimate the resources to break the following systems on fault-tolerant superconducting cat-qubit hardware:<\/p>\n<p>\u2022 RSA-2048: 22,593 physical qubits, 3.14 days. RSA relies on the difficulty of factoring large integers. It is one of the world\u2019s most widely used public-key systems, securing much of the internet, from online banking to email and digital signatures.<\/p>\n<p>\u2022 ECDLP-256: 29,588 physical qubits, 61.8 minutes. The elliptic-curve discrete logarithm problem underpins elliptic-curve cryptography, including ECDSA, which secures blockchains such as Bitcoin and Ethereum, and ECDH, which is used to set up encrypted connections across the web. For Bitcoin, about an hour is longer than the network\u2019s 10-minute block time, so transactions in progress remain out of reach.<\/p>\n<p>\u201cShor\u2019s algorithm is the iconic benchmark for quantum computing, with a well-defined mathematical problem and a clear quantum advantage. Estimates of the resources needed to run the algorithm have been steadily falling as the field has developed better approaches to error correction and algorithm design. This latest estimate doesn\u2019t just push that frontier, it changes the paradigm altogether: fewer than 23,000 physical cat qubits could be enough to factor RSA-2048 in just three days,\u201d said Th\u00e9au Peronnin, CEO, Alice &amp; Bob.<\/p>\n<p>How it was done<\/p>\n<p>Most resource estimates count the logical qubits an algorithm needs, then multiply by an average number of physical qubits per logical qubit. This work goes further: for the parts of the algorithm that use the most resources, it works out exactly what each physical qubit does and when, producing complete chip layouts and schedules.<\/p>\n<p>The results rest on three advances:<\/p>\n<p>\u2022 Cat qubits: Alice &amp; Bob\u2019s cat qubits suppress bit-flip errors at the hardware level, so error correction only needs to handle phase-flips. This sharply cuts the number of physical qubits per logical qubit.<\/p>\n<p>\u2022 LDPC-cat codes: LDPC-cat codes (2024) are more efficient than the repetition code used in its earlier cat-qubit estimates (2023), and more than halve the qubit count, from 49,649 to 22,593 for RSA-2048.<\/p>\n<p>\u2022 A redesigned adder: Addition is one of the operations Shor\u2019s algorithm runs most often. The team rebuilt it from the ground up for cat qubits, so it runs at a steady speed without stopping to wait for error correction.<\/p>\n<p>On the algorithm side, the team drew on recent breakthroughs from Inria (IACR ePrint) and Google (arXiv) to make the algorithms more efficient.Why it matters<\/p>\n<p>Although substantial engineering challenges remain, Alice &amp; Bob expect hardware improvements and falling resource requirements to converge in the early 2030s.<\/p>\n<p>The cryptography results are just one example of how the unique properties of quantum mechanics can be harnessed to tackle problems that remain out of reach of today\u2019s classical computers, with the potential to drive breakthroughs across entire fields ranging from materials science and chemistry to physics.<\/p>\n<p><strong>Also Read:\u00a0<a href=\"https:\/\/aithority.com\/interviews\/aithority-interview-with-gou-rao-co-founder-and-ceo-at-neubird-ai\/\" target=\"_blank\" rel=\"noopener nofollow\">AiThority Interview with Gou Rao, co-founder and CEO at NeuBird AI<\/a><\/strong><\/p>\n<p>Preparing for the Post-Quantum Era<\/p>\n<p>Replacing cryptographic infrastructure across large organizations can take years. US and UK guidance calls for organizations to complete the transition to post-quantum cryptography by 2035. As advances in quantum computing keep reducing the hardware needed, Alice &amp; Bob recommends that organizations begin that transition now.<\/p>\n<p>At the same time, post-quantum schemes need to build confidence through continued testing and scrutiny. They earn trust by surviving attempts to break them, so quantum cryptanalysis of these new schemes deserves the same effort as that of RSA and elliptic curves.<\/p>\n<p>Alice &amp; Bob is engaging with government and industry stakeholders to support their understanding of this work and its implications for the urgent transition to post-quantum cryptography.<\/p>\n<p>\u201cFor the cryptographic community, figuring out how soon Shor\u2019s algorithm, run on a quantum computer, poses a concrete threat to classical public key cryptography is of paramount importance. This paper details how you implement these algorithms on Alice &amp; Bob\u2019s physical architecture and once again reduces the resources required to do so. For anyone keeping track of how soon the threat from quantum computers becomes real \u2013 this is an important paper,\u201d said Professor Antoine Joux, specialist in cryptanalysis and G\u00f6del Prize laureate.<\/p>\n<p>\u201cThis very valuable research proves that the risk security leaders have been preparing for is real and approaching fast. The post-quantum standards to replace vulnerable cryptography already exist. Businesses and governments need to work together to deploy PQC in the most mission-critical places straight away, bake crypto-agility into their systems, and plan to complete their transition well ahead of the impending deadlines,\u201d said Dr Ali El Kaafarani, Founder &amp; CEO, PQShield.<\/p>\n<p><strong>Also Read:\u00a0<a href=\"https:\/\/aithority.com\/machine-learning\/the-infrastructure-war-behind-the-ai-boom\/\" target=\"_blank\" rel=\"noopener nofollow\">\u200b\u200b<\/a><a href=\"https:\/\/aithority.com\/ait-featured-posts\/ai-and-the-future-of-work-artificial-intelligence-is-expanding-organizational-intelligence-beyond-human-limits\/\" target=\"_blank\" rel=\"noopener nofollow\">AI and The Future of Work: Artificial Intelligence Is Expanding Organizational Intelligence Beyond Human Limits<\/a><\/strong><\/p>\n<p><b>[To share your insights with us, please write to\u00a0<\/b><a href=\"https:\/\/aithority.com\/machine-learning\/neural-networks\/quantum-computing\/alice-bob-sets-record-low-for-quantum-resources-required-to-break-internet-encryption\/mailto:psen@itechseries.com\" target=\"_blank\" rel=\"noopener nofollow\"><b>psen@itechseries.com<\/b><\/a><b> ]<\/b><\/p>\n<p>\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"23K physical qubits running for 3 days could break RSA-2048, which secures internet encryption. 30K physical qubits could&hellip;\n","protected":false},"author":3,"featured_media":1160274,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":"","_share_on_mastodon":"0"},"categories":[19],"tags":[691,134150,745,16721,462089,712,4587,918,158,67,132,68],"class_list":["post-1160273","post","type-post","status-publish","format-standard","has-post-thumbnail","category-internet","tag-ai","tag-alice-bob","tag-computing","tag-engineering","tag-google-quantum","tag-internet","tag-quantum","tag-quantum-computing","tag-technology","tag-united-states","tag-unitedstates","tag-us"],"share_on_mastodon":{"url":"https:\/\/pubeurope.com\/@us\/117546827413991125","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts\/1160273","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/comments?post=1160273"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts\/1160273\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/media\/1160274"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/media?parent=1160273"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/categories?post=1160273"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/tags?post=1160273"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}