Quantum Computers Pose a Threat to Encryption, New Algorithm Developed
Quantum computers have the potential to hack modern encryption. A scientist from New York University has developed a new algorithm that can significantly speed up this process.
It is widely believed that a powerful quantum computer could render our advanced cryptographic schemes useless, jeopardizing the security of most of our Internet data. Scientist Oded Reghev has discovered a new algorithm that can notably reduce the number of steps required for such a hack. The algorithm has been reported as a breakthrough in the field.
Reghev’s algorithm is an adaptation of the one originally developed in 1994 by Peter Shor from MIT. Shor’s algorithm used the popular RSA cryptographic scheme to lay out numbers on simple factors. Reghev’s modification offers a more efficient way to search for the simple multipliers of a number, requiring significantly fewer logical steps. While Shor’s algorithm required N^2 gate operations to factorize a number, Reghev’s method only needs N^1.5 Gate operations.
However, there are certain practical limitations that need to be addressed. One concern is whether the optimization developed for the Shor algorithm will be compatible with the new method. Additionally, Martin Ecker, a researcher in the field of quantum calculations from Sweden, has pointed out that the new algorithm will likely require a quantum memory to store intermediate values.
Despite these obstacles, these studies serve as a reminder that the threat posed by quantum computers to encryption is constantly evolving. The development of post-quantum schemes is an essential task in the field of cryptography to ensure data security in the future.