麻豆淫院

A team of researchers at AI Google Quantum AI, led by Craig Gidney, has outlined advances in quantum computer algorithms and error correction methods that could allow such computers to crack Rivest鈥揝hamir鈥揂dleman (RSA) encryption keys with far fewer resources than previously thought. The development, the team notes, suggests encryption experts need to begin work toward developing next-generation encryption techniques. The paper is on the arXiv preprint server.

RSA is an encryption technique developed in the late 1970s that involves generating public and private keys; the former is used for encryption and the latter decryption. Current standards call for using a 2,048-bit encryption key. Over the past several years, research has suggested that quantum computers would one day be able to crack RSA encryption, but because quantum development has been slow, researchers believed that it would be many years before it came to pass.

Some in the field have accepted a theory that a quantum computer capable of cracking such codes in a reasonable amount of time would have to have at least 20 million qubits. In this new work, the team at Google suggests it could theoretically be done with as few as a million qubits鈥攁nd it could be done in a week.

The team at Google has been developing new, more efficient algorithms, some of which involve building on work done with approximate modular exponentiation. The team has also been working to improve error-correction methods that involve implementation of denser models that make use of storing corrected qubits.

In his paper, Gidney acknowledges that more work is required to achieve a computer capable of cracking RSA codes鈥攕uch computers still typically have thousands of qubits rather than the required millions. He does note, however, that advances in quantum computing are moving at a rate that suggests the time has come for security experts and encryption specialists to advance technology to safeguard sensitive data in the future.

漏 2025 Science X Network