Shor's algorithm
Shor's algorithm is a quantum algorithmic computing process for cryptography.[1] Basically, it solves the following problem: Given an integer [math]\displaystyle{ N }[/math], find its prime factors.
Its effectiveness may eventually undermine the security of the important RSA encryption device.
Shor's Algorithm Media
Quantum subroutine in Shor's algorithm
References
- ↑ Shor, P.W.. Algorithms for quantum computation: discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science (1994)IEEE Comput. Soc. Press. p. 124–134. ISBN 0818665807. doi:10.1109/sfcs.1994.365700.
±