{"id":58694,"date":"2025-09-04T18:00:05","date_gmt":"2025-09-04T15:00:05","guid":{"rendered":"https:\/\/forklog.com\/en\/?p=58694"},"modified":"2025-09-04T18:05:18","modified_gmt":"2025-09-04T15:05:18","slug":"quantum-computer-cracks-tiny-cryptographic-key","status":"publish","type":"post","link":"https:\/\/forklog.com\/en\/quantum-computer-cracks-tiny-cryptographic-key\/","title":{"rendered":"Quantum Computer Cracks &#8216;Tiny&#8217; Cryptographic Key"},"content":{"rendered":"<p>Engineer Steve Tippeconnic has cracked a six-bit cryptographic key on <span data-descr=\"elliptic curves\" class=\"old_tooltip\">ECC<\/span> using IBM&#8217;s quantum computer.\u00a0<\/p>\n<blockquote class=\"twitter-tweet\">\n<p lang=\"zxx\" dir=\"ltr\"><a href=\"https:\/\/t.co\/mGgItaybRE\">https:\/\/t.co\/mGgItaybRE<\/a><\/p>\n<p>\u2014 Steve Tippeconnic (@stevetipp) <a href=\"https:\/\/twitter.com\/stevetipp\/status\/1962935033414746420?ref_src=twsrc%5Etfw\">September 2, 2025<\/a><\/p><\/blockquote>\n<p> <script async src=\"https:\/\/platform.twitter.com\/widgets.js\" charset=\"utf-8\"><\/script><\/p>\n<p>In the experiment, the specialist used IBM Torino&#8217;s 133-qubit processor to attack the simplified key. The algorithm executed a 340,000-layer quantum circuit and successfully computed the private key from the public equation.<\/p>\n<p>In June, Chinese scientists from Shanghai University <a href=\"https:\/\/forklog.com\/en\/news\/quantum-computer-cracks-22-bit-rsa-encryption\">cracked<\/a> 22-bit encryption of <span data-descr=\"abbreviation from the surnames Rivest, Shamir, and Adleman \u2014 a public-key cryptographic algorithm\" class=\"old_tooltip\">RSA<\/span>.<\/p>\n<h2 class=\"wp-block-heading\">What Does This Mean for Bitcoin and Ethereum?\u00a0<\/h2>\n<p>According to experts, the latest advancement in quantum computing does not threaten the security of the largest blockchains. Bitcoin and Ethereum use a more robust algorithm \u2014 ECC-256. Cracking it with current technology remains impossible.\u00a0<\/p>\n<blockquote class=\"twitter-tweet\">\n<p lang=\"en\" dir=\"ltr\">Progress: This demo shows IBM&#8217;s 133-qubit quantum computer cracking a tiny 6-bit elliptic curve key (like those in Bitcoin) using Shoe\u2019s algorithm variant. Real crypto uses 256-bit keys.<a href=\"https:\/\/t.co\/lhFhmUfIPN\">https:\/\/t.co\/lhFhmUfIPN<\/a><\/p>\n<p>\u2014 JaguarAnalytics (@JaguarAnalytics) <a href=\"https:\/\/twitter.com\/JaguarAnalytics\/status\/1963373828798636455?ref_src=twsrc%5Etfw\">September 3, 2025<\/a><\/p><\/blockquote>\n<p> <script async src=\"https:\/\/platform.twitter.com\/widgets.js\" charset=\"utf-8\"><\/script><\/p>\n<p>Scientist and founder of Pauli Group, Pierre-Luc Dallaire Demers, noted that the next step will be experiments with error correction. This will enable the creation of &#8220;deep circuits with full reversible modular arithmetic subroutines.&#8221;\u00a0<\/p>\n<blockquote class=\"twitter-tweet\">\n<p lang=\"en\" dir=\"ltr\">If he keeps going like that, <a href=\"https:\/\/twitter.com\/stevetipp?ref_src=twsrc%5Etfw\">@stevetipp<\/a> will just end up breaking ECC-256 at some point.<br \/>Next step would be experiments with error correction to start building up very deep circuits with the full reversible modular arithmetic subroutines. <a href=\"https:\/\/t.co\/WjkAO4mmSo\">https:\/\/t.co\/WjkAO4mmSo<\/a><\/p>\n<p>\u2014 Pierre-Luc (@dallairedemers) <a href=\"https:\/\/twitter.com\/dallairedemers\/status\/1963055942070894676?ref_src=twsrc%5Etfw\">September 3, 2025<\/a><\/p><\/blockquote>\n<p> <script async src=\"https:\/\/platform.twitter.com\/widgets.js\" charset=\"utf-8\"><\/script><\/p>\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>&#8220;If [Tippeconnic] continues in this vein, he will eventually reach ECC-256,&#8221; he added.\u00a0<\/p>\n<\/blockquote>\n<p>Some have pointed out that cracking a six-bit cryptographic key cannot be considered an achievement.\u00a0<\/p>\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>&#8220;When you see hype about quantum computers, do as I do \u2014 just ignore it. A six-bit elliptic curve key is only 64 possible combinations. I can &#8216;crack&#8217; it with pen and paper in a couple of hours. It&#8217;s not even worth posting about, but this is X \u2014 and it will spread like wildfire,&#8221; <a href=\"https:\/\/x.com\/Adrian_R_Morris\/status\/1963411639593832690\">wrote<\/a> user Adrian Morris.\u00a0<\/p>\n<\/blockquote>\n<p>Back in July, a group of developers <a href=\"https:\/\/forklog.com\/en\/news\/developers-propose-quantum-resistant-solution-for-bitcoin\">found<\/a> a way to protect the first cryptocurrency&#8217;s network from potential threats posed by quantum computers.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Engineer Steve Tippeconnic has cracked a six-bit cryptographic key on ECC using IBM&#8217;s quantum computer.<\/p>\n","protected":false},"author":1,"featured_media":58695,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"select":"1","news_style_id":"1","cryptorium_level":"","_short_excerpt_text":"Experts say the situation does not threaten Bitcoin and Ethereum security.","creation_source":"","_metatest_mainpost_news_update":false,"footnotes":""},"categories":[3],"tags":[18,46,575,1360],"class_list":["post-58694","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-news-and-analysis","tag-bitcoin","tag-ethereum","tag-quantum-computers","tag-quantum-computing"],"aioseo_notices":[],"amp_enabled":true,"views":"2511","promo_type":"1","layout_type":"1","short_excerpt":"Experts say the situation does not threaten Bitcoin and Ethereum security.","is_update":"","_links":{"self":[{"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/posts\/58694","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/comments?post=58694"}],"version-history":[{"count":1,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/posts\/58694\/revisions"}],"predecessor-version":[{"id":58696,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/posts\/58694\/revisions\/58696"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/media\/58695"}],"wp:attachment":[{"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/media?parent=58694"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/categories?post=58694"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/forklog.com\/en\/wp-json\/wp\/v2\/tags?post=58694"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}