Shor's algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Shor's algorithm is a quantum algorithmic computing process for cryptography.^[1] Basically, it solves the following problem: Given an integer $N$ , find its prime factors.

Its effectiveness can be used to find messages hidden through RSA encryption, however it requires a quantum computer with more quantum bits than there are available.

References

↑ 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.

This short article about mathematics can be made longer. You can help Wikipedia by adding to it.

[1] 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.

[1]