Quantum computer with ability to decipher current encryption method in the future is born?


Solving prime factorization of a large number of digits is a challenging task that requires a considerable amount of time even if a supercomputer is used, and based on this, it is one of the encryption methodsRSA encryptionIs made. However, a quantum computer that can solve the "large factor prime factorization" which is the root of this encryption method at high speed is being born.

The beginning of the end for encryption schemes? | MIT News

Quantum Computer Comes Closer to Cracking RSA Encryption - IEEE Spectrum

Researchers at MIT and Innsbruck University have created a new quantum computer with 5 qubits. Whereas the minimum unit / bit handled by a conventional computer (classical computer) could only be in the state of 0 or 1, quantum computer can take quantum mechanically superposition state of 0 and 1 With qubit (qubit) we can superimpose and hold 0 and 1 for 1 qubit at any ratio, enabling parallel computing on a scale impossible with classical computers.

In a new quantum computer, it is possible to calculate faster than conventional quantum computers by converting four atoms into a logic gate by superposing four atoms with a laser pulse and simultaneously maintaining two different energy states It is said that it became.

Traditionally, it is generally said that 12 qubits are required to perform 15 prime factorization, and in December 2001 IBM's Almaden Laboratories succeeded in prime factorization of 15 with 7 qubit quantum computers Although it was picked up, this is the first case to realize with 5 qubits.

At present, it is "prime factorization of 15", but if the performance improves and a larger number of prime factorization becomes possible, the security of RSA encryption can not be guaranteed. This may be the "beginning of the end" of the current encryption method.

in Hardware, Posted by logc_nt