Shor's algorithm

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.

References

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

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

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

[1]