Shor's algorithm is a quantum algorithmic computing process for cryptography. Basically, it solves the following problem: Given an integer , find its prime factors.
Its effectiveness may eventually undermine the security of the important RSA encryption device.
References[change | change source]
- ↑ Shor, P.W. (1994). "Algorithms for quantum computation: discrete logarithms and factoring". Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press: 124–134. doi:10.1109/sfcs.1994.365700. ISBN 0818665807. S2CID 15291489.