Quantum research reduces resources needed to break encryption

Two new whitepapers show that quantum computers could crack vital elliptic-curve cryptography with far fewer resources than previously estimated. One study using neutral atoms suggests breaking 256-bit ECC in 10 days with under 30,000 physical qubits. Google researchers outlined a method to target bitcoin's secp256k1 curve in under 10 minutes using about 500,000 physical qubits.

Researchers have demonstrated that neutral atoms trapped in optical tweezers can serve as reconfigurable qubits, allowing all qubits to interact freely. This approach enables more efficient error correction compared to superconducting qubits limited to nearby neighbors. Their analysis, titled 'Shor’s algorithm is possible with as few as 10,000 reconfigurable atomic qubits,' concludes that fewer than 30,000 physical qubits could break 256-bit elliptic-curve cryptography (ECC) in 10 days—a 100-fold reduction in overhead from prior estimates. The team noted that arrays exceeding 6,000 qubits have already been built and urged a shift to post-quantum cryptography standards. “Appropriately designed neutral-atom architectures could support cryptographically relevant implementations of Shor’s algorithm,” the researchers wrote. Separately, Google researchers improved Shor’s algorithm to solve the elliptic-curve discrete logarithm problem over secp256k1, the curve securing bitcoin and other blockchains. They described two quantum circuits: one with fewer than 1,200 logical qubits and 90 million Toffoli gates, the other under 1,450 logical qubits and 70 million gates, requiring roughly 500,000 physical qubits—20 times fewer resources than 2003 estimates. Google withheld algorithmic details, releasing a zero-knowledge proof instead, citing risks of misuse by adversaries. The team consulted the US government and argued that progress now warrants limiting disclosures on quantum cryptanalysis. Brian LaMacchia, a cryptography expert formerly at Microsoft, said the papers show steady advances in qubits and algorithms toward practical cryptographically relevant quantum computing. However, Matt Green of Johns Hopkins University called Google's caution alarmist and more hype than substance. LaMacchia also questioned the focus on cryptocurrencies over broader public-key systems.

相关文章

Researchers have reduced the quantum computing power required to break the widely used RSA encryption algorithm by a factor of ten, to about 100,000 qubits. This advancement builds on prior work and highlights growing vulnerabilities in current security systems. However, significant engineering challenges persist in building such machines.

由 AI 报道

Experts at the Q2B Silicon Valley conference in December hailed significant advances in quantum computing hardware, describing the progress as spectacular despite remaining challenges. Leaders from science and industry expressed optimism about achieving industrially useful, fault-tolerant devices in the coming years. Applications for health, energy, and scientific discovery are also gaining traction.

Researchers have used quantum superposition to help qubits violate a fundamental quantum limit, allowing them to maintain information five times longer. This breakthrough involves a three-qubit system that demonstrates extreme correlations over time. The finding could enhance quantum computing and metrology applications.

由 AI 报道

Researchers anticipate that 2026 could mark the beginning of practical applications for quantum computers in chemistry, leveraging their inherent quantum nature to tackle complex molecular calculations. Advances in 2025 have laid the groundwork, with larger machines expected to enable more sophisticated simulations. This progress could benefit industrial and medical fields by improving predictions of molecular structures and reactivities.

 

 

 

此网站使用 cookie

我们使用 cookie 进行分析以改进我们的网站。阅读我们的 隐私政策 以获取更多信息。
拒绝