Shulou(Shulou.com)11/24 Report--

CTOnews.com, January 8, more than 20 experts from seven Chinese scientific research institutions, including Tsinghua University and Zhejiang University, jointly published an academic paper on the preprint platform arxiv, saying that a quantum computer with only 372qubits (qubits) can crack a 2048-bit RSA key.

This paper, entitled "Factoring integers with sublinear resources on a superconducting quantum processor" (factorization using sublinear resources on superconducting quantum processors), uses the latest decomposition algorithm of German mathematician and cryptographer Klaus Schnauer (Claus-Peter Schnorr), combined with quantum approximate optimization algorithm (QAOA), and can use fault-intolerant (NISQ, or noisy medium-sized quantum) quantum computers. It takes only 372physical qubits (qubits) to crack.

If this scientific achievement is true, it is undoubtedly a major development. At present, IBM's quantum computer Osprey has reached 433 qubits, which means that the existing quantum computer can crack the 2048-bit RSA key.

CTOnews.com Lecture: the RSA public key encryption algorithm was proposed by Ronald Ron Rivest, Adi Shamir and Leonard Adleman in 1977. It was first announced in 1987, when all three of them worked at MIT. RSA is made up of the initials of the three surnames.

RSA algorithm is an asymmetric encryption algorithm, which generates a pair of RSA keys, that is, public key + private key, and provides the public key to the caller. After the caller encrypts the data with the public key, the API decrypts the data according to the private key.

RSA key length refers to the number of bits in the module. For example, a 2048-bit RSA key refers to a RSA key pair with a modulus of 2048 bits. The usual values are: 1024, 2048, 4096, etc.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.