What is Shor's algorithm?
'''Shor's algorithm''' is a quantum [[algorithm]]ic computing process for [[cryptography]].<ref>{{Cite journal|last=Shor|first=P.W.|title=Algorithms for quantum computation: discrete logarithms and factoring|url=https://doi.org/10.1109/sfcs.1994.365700|journal=Proceedings 35th Annual Symposium on Foundations of Computer Science|year=1994|pages=124–134|publisher=IEEE Comput. Soc. Press|doi=10.1109/sfcs.1994.365700|isbn=0818665807|s2cid=15291489}}</ref> Basically, it solves the following problem: Given an integer <math> N </math>, find its [[prime number|prime factor]]s. Its effectiveness can be used to find messages hidden through [[RSA algorithm|RSA]] [[encryption]], however it requires a quantum computer with more quantum bits than there are available. ==References== {{reflist}} {{Quantum information}} {{-}} {{Math-stub}} [[Category:Numbers]] [[Category:Algebra]] [[Category:Algorithms]] [[Category:Cryptography]]