Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
复制标题
DOI：
10.1137/s0097539795293172
复制
发表时间：
1997-10-01
影响因子：
1.6
通讯作者：
Shor, PW
中科院分区：
文献类型：
--
作者：
Shor, PW
Please try later.
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.