Recently an article by Chinese researchers Published in which it is claimed that by using the quantum computer and the presented methods, these people have been able to break the RSA-2048 asymmetric encryption. This scientific article titled “Integer factorization with sublinear sources in a superconducting quantum processor”It shows that by using the recent algorithm of scientist and mathematician Claus Peter Schnorr, together with a quantum approximate optimization algorithm (QAOA) and using a quantum computer with only 372 qubits, it is possible to break the widely used RSA-2048 encryption. Failure.
The most used and strongest encryption algorithm in the digital world today is AES, which is known as a symmetric encryption algorithm. This means that AES uses the same key to encrypt and decrypt data. This issue has become a problem in the two-way world of the Internet, where there is always one side of the server and the other side of the client computer, and the use of this method of encryption and key sharing on a large scale brings a great risk, which also endangers the philosophy of using encryption. .
This is where the extensive use and combination of another cryptographic algorithm, RSA, to secure the AES single key was proposed. RSA, named after the scientists who designed it at MIT, namely Shamir, Adleman and Rivest, was first proposed in 1977, and unlike the single-key and symmetric AES algorithm, it is an asymmetric cryptographic algorithm with support for 2 keys that are derived from a public key. Known and available to everyone, it uses for data encryption.
In many modern communication environments, including the Internet, most of the data is encrypted by the AES algorithm. To obtain the secret key needed to decrypt the data, authorized recipients (servers) publish a public key while keeping the associated private key that only they know and that is essential to the security of the information. Then, before sending data on the Internet, the sender (client computer) uses the public key and RSA to encrypt the data and send its AES secret key to the receiver, which is the server, and the secret key can finally be used to decrypt the data on the receiver’s side.
In this regard, if the claims of Chinese researchers are true, this can be called a significant development in this field, especially considering that the power of today’s quantum computers (IBM 433-qubit Osprey) is greater than 433 qubits. In the past years, there have been speculations about quantum computers breaking current cryptographic algorithms, but it was expected that this would be years away and that this could be done by quantum computers stronger than today.
In 2019, researchers claimed in an article that a 2048 Bit RSA key can be factored in 8 hours using a 20 million qubit quantum computer without using error correction methods. In recent years, with the publication of news in this regard and the progress of quantum computers, the US National Security Agency and other responsible institutions have begun to develop new and resistant algorithms against quantum computers, and the news of the introduction of four cryptographic algorithms by NIST for use against quantum computers, which in It was published in July and is one of the initial results of these measures.
The claim of Chinese researchers about breaking RSA encryption has not been fully confirmed in the scientific community, and while Bruce Schneier, an active researcher in this field, considered it neither wrong nor right, Scott Aaronson, head of the Department of Computer Science at the University of Texas and head of the department Quantum information has rejected the correctness of the article by Chinese researchers.
- Wide release of Github’s secret scanning feature until January 2023
- The White House’s requirement to obtain a software security certificate for use in the US government
- NIST’s retirement of the SHA-1 hash algorithm and recommendation that it not be used
- Google, in collaboration with NIST, makes an open source chip for startups and universities