Chinese researchers such as Tsinghua University and Zhejiang University published a paper on the preprint platform arxiv, reporting that the number of qubits required to crack the 2048-bit RSA key can be greatly reduced, and existing quantum computers can do it. According to the researchers, Peter Shor discovered in the 1990s that it is easy to factor large numbers with a quantum computer, but the number of qubits required needs to be in the millions, and existing technology cannot manufacture such scale quantum computer. Today’s most advanced quantum computers have only a few hundred qubits — IBM’s Osprey, for example, has 433 qubits. Chinese researchers have come up with an optimization that reduces the number of qubits required to 372 qubits—something that is possible with existing technology, although China does not yet have such an advanced quantum computer. Bruce Schneier, a well-known cryptography expert, pointed out on his blog that the optimization method proposed by Chinese researchers is based on a controversial paper recently published by Peter Schnorr. Schnorr’s algorithm collapsed on a larger system, so whether the Chinese method is successful Still unknown, but at least IBM researchers can test it.
This article is transferred from: https://www.solidot.org/story?sid=73807
This site is only for collection, and the copyright belongs to the original author.