CarderPlanet
Professional
- Messages
- 2,552
- Reaction score
- 696
- Points
- 83
Are quantum computers ready for an attack on RSA?
Quantum computers have the potential to crack modern encryption. A new algorithm developed by a scientist from New York University can significantly speed up this process.
Today, it is believed that a powerful quantum computer can render our advanced cryptographic schemes useless. At the same time, many of these schemes ensure the security of most of our data on the Internet. It is reported that Oded Regev discovered a new algorithm that can significantly reduce the required number of qubits to implement such a hack.
Regev modified an algorithm developed in 1994 by Peter Shore of MIT. Shor created a method for decomposing numbers into prime factors, which is the basis of the popular RSA cryptographic scheme. Regev offers an efficient way to find prime factors of a number, requiring much fewer logical steps. While Shor's original algorithm required n^2 gates to factorize a number, Regev's new method requires only n^1.5 gates.
However, there are practical limitations. For example, it is unclear whether the optimizations developed for Shor's algorithm can work with the new method. In addition, Martin Eckera, a researcher in the field of quantum computing from Sweden, noted that the new algorithm will probably require quantum memory to store intermediate values.
However, these studies serve as a reminder that the threat of quantum computers for encryption is constantly changing, and the transition to post-quantum schemes is an important task today.
Quantum computers have the potential to crack modern encryption. A new algorithm developed by a scientist from New York University can significantly speed up this process.
Today, it is believed that a powerful quantum computer can render our advanced cryptographic schemes useless. At the same time, many of these schemes ensure the security of most of our data on the Internet. It is reported that Oded Regev discovered a new algorithm that can significantly reduce the required number of qubits to implement such a hack.
Regev modified an algorithm developed in 1994 by Peter Shore of MIT. Shor created a method for decomposing numbers into prime factors, which is the basis of the popular RSA cryptographic scheme. Regev offers an efficient way to find prime factors of a number, requiring much fewer logical steps. While Shor's original algorithm required n^2 gates to factorize a number, Regev's new method requires only n^1.5 gates.
However, there are practical limitations. For example, it is unclear whether the optimizations developed for Shor's algorithm can work with the new method. In addition, Martin Eckera, a researcher in the field of quantum computing from Sweden, noted that the new algorithm will probably require quantum memory to store intermediate values.
However, these studies serve as a reminder that the threat of quantum computers for encryption is constantly changing, and the transition to post-quantum schemes is an important task today.
