Shor's algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Shor's algorithm is a quantum algorithmic computing process for cryptography.[1] 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]

  1. Shor, P.W.. "Algorithms for quantum computation: discrete logarithms and factoring". Proceedings 35th Annual Symposium on Foundations of Computer Science (IEEE Comput. Soc. Press). doi:10.1109/sfcs.1994.365700. ISBN 0818665807. https://doi.org/10.1109/sfcs.1994.365700.