A group of researchers from several Chinese scientific centers and universities suggested a new way to optimize the process Factorization parameters RSA computers on quantum computers. According to the researchers, the method developed by them allows you to get by to hack the keys of the RSA-2048 quantum computer with 372 cubes. For comparison, IBM Osprey , the most powerful of the now created quantum computers, contains 433 cubes. Nevertheless, the method is only theoretical, has not been tested in practice and causes skeptical attitude of some cryptographers.
The RSA encryption is based on the operation of the construction of a large number module. Openly contains a module and degree. The module is formed on the basis of two random simple numbers, which are known only to the owner of the closed key. Quantum computers allow you to effectively solve the problem of decomposing the number into simple factors, which can be used to synthesize a closed key based on an open.
Until now, it was believed that taking into account the current development of quantum computers of the RSA-Sloks in size of 2048 bits for a long time will not be able to be hacked, since when using the classic Schora algorithm To factorize a 2048-bit RSA key requires a quantum computer with millions of cubes. The method proposed by Chinese researchers raises this assumption to doubt and, in the case of confirmation of performance, allows the RSA-2048 keys not on systems of a distant future, but on existing quantum computers.
The method is based on proposed in 2021 of the Schnorra factorization algorithm, which allows you to achieve a radical reduction in the number of operations when selecting on ordinary computers. Nevertheless, in practice, the algorithm turned out to be inexperienced for hacking real keys, since it worked only for RSA-keysters with small values of the module (an integer that needs to be decomposed by simple numbers). To factorize large numbers, the algorithm was unsuitable. Chinese researchers argue that with the help of quantum methods, they were able to circumvent the restriction of the use of Schnorra’s algorithm.