The June 24th report explains by researchers from Shanghai University They were able to disassemble the 22-bit RSA key. This meant breaking encryption systems widely used to protect sensitive data such as banking transactions and digital communications.
Although the 22-bit is modest in length compared to the 2,048-bit RSA keys that are actually used, Shanghai University’s success suggests a step forward in the application of quantum technology.
This experiment was based on converting factorization problems (which support RSA) into combinatorial optimization problems. Asymmetric encryption system, RSA guarantees sensitive data when using key pairs. Private to decrypt with the public to encrypt, Its security depends on the difficulty of breaking down a large number with its main factors.
Classically, breaking the RSA key requires exponential time on a traditional computer, but using algorithms such as SHOR, quantum computing can reduce its complexity.
However, the Shanghai University team chose to use a quantum recall processor created by the company D-Wave Systems. This is a technique that uses quantum variation to explore solution spaces. This technique, which avoids deep circuits typical of other quantum systems, produces a more optimal solution.
The report shows that this D-Wave system processor used 5,000 qubits (a basic quantum information unit) to achieve factorization.
It does not specify that, but it is understood that this publication refers to 5,000 physical qubits. In quantum computing, logical qubits are truly important qubits. Ensures error correction and long-term stabilityEach of them is each of them, for hundreds or thousands of physical qubits that work together.
This advancement in Chinese universities does not mean that RSA encryption is committed today. The current key is exponentially large in size and resists attacks.
However, this experiment teaches you how to improve your hardware and what quantum algorithms are approaching Q-Day on the day when current encryption becomes vulnerable.
In the case of Bitcoin, the impact is indirect as it does not use RSA encryption. Bitcoin is based on ECDSA (digital signature of an elliptic curve) and SHA-256 to ensure a network that protects users’ private keys and ensures current integrity.
Many analysts believe quantum risk is still far away, including Adam Back, Bitcoiner Developer and Blockstream founder Adam Back. “1 20 years’ distance” Due to current limitations of quantum computing.
However, other numbers in quantum development warn that this danger can be approached faster with ongoing technological advances.
From Google they also warn of the risks of the RSA scheme
At the end of May last year, Google Quantum AI published its report Strengthen concerns about vulnerabilities The future of RSA encryption will extend them to the elliptic curve system diffie-hellman (ECDH).
According to the research, both RSA and ECDH are used in asymmetric encryption to protect communications and digital signatures (to verify document reliability). They face the risk of attacks “Save now, decipher later”,encrypted data will be stored for future Hatchendo.
Google’s speculation is that, as ECDH is related to ECDSA, it is a bullet that touches Bitcoin, even if the report doesn’t mention it. Both protocols share a mathematical base in elliptic curves, and both rely on the difficulty of the careful logarithmic problem of elliptic curves, making them robust in the face of classical attacks, but Probably breakable before quantum algorithms like Shor future.
This study calculates that breaking the 2,048-bit RSA key (commonly used in digital safety) can be achieved. Less than 1 million physical cubitscompared to the estimated 20 million people in 2019.
The decline is due to two factors. Better algorithms and advances in error correction. Logical qubits, the algorithm uses in multiple physical qubits to detect and correct errors, optimized the process.