![\"The](\"https:\/\/www.newsbeep.com\/us\/wp-content\/uploads\/2026\/04\/d41586-026-01054-1_52243780.jpg\"\/)
<\/p>\n <\/p>\n
Cloudflare is one of several cybersecurity companies now reassessing their timelines to provide protection against quantum hacking.Credit: Richard B. Levine\/Alamy<\/p>\n
The world could be caught off guard by quantum hackers before the end of this decade \u2014 much sooner than expected. This is the take-home message of two studies posted independently on 30 March, one a white paper by a team at Google1<\/a> and the other a preprint from Oratomic2<\/a>, a start-up company in Pasadena, California.<\/p>\n Digital technologies that rely on encryption and authentication methods \u2014 such as credit-card systems, cryptocurrencies and Internet communications \u2014 have long been known to be vulnerable to future quantum computers<\/a>. That\u2019s because the machines will be capable of cracking security measures faster than even the largest conventional supercomputers can.<\/p>\n But the assumption among researchers and cybersecurity companies working on quantum-proof encryption technologies<\/a> has been that these machines would not become a serious threat to digital security<\/a> for at least ten years<\/a>.<\/p>\n The studies, both of which suggest that quantum computers capable of cracking current encryption systems could soon become available, have created a sense of \u201crenewed urgency\u201d, says Jintai Ding, a mathematician at Tsinghua University in Beijing. The findings have prompted \u201cmany discussions among people I know, ranging from academics to bankers and to people who care about cryptocurrencies\u201d, says Ding.<\/p>\n \u201cIt\u2019s a real shock for us too,\u201d says Bas Westerbaan, a mathematician at the Internet-services company Cloudflare, based in San Francisco, California, which helps to protect one-quarter of the world\u2019s Internet traffic. \u201cWe are still digesting it, but we are very concerned.\u201d<\/p>\n In a 1 April blog post<\/a>, Scott Aaronson, a quantum-computing researcher at the University of Texas at Austin, describes the studies, which have not yet been peer reviewed, as \u201cquantum computing bombshells\u201d.<\/p>\n Fewer qubits<\/p>\n The preprint posted by Oratomic, a spin-off of the California Institute of Technology, also in Pasadena, demonstrates a method to lower the amount of estimated quantum computing required for cracking two types of common security technology. The approach leverages the strengths of a type of quantum computing that uses atoms trapped with lasers<\/a>, and combines a number of recent developments<\/a> in quantum software and hardware.<\/p>\n The authors also added their own improvements to show that cracking a common security-key technology called P-256 \u2014 because it relies on keys that are 256 bits long \u2014 could require as few as 10,000 qubits. These are the units of quantum information that replace the bits of ordinary computers.<\/p>\n
![\"\"](\"https:\/\/www.newsbeep.com\/us\/wp-content\/uploads\/2026\/04\/d41586-026-01054-1_52128668.jpg\"\/)
<\/p>\n