Shor's algorithm
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 can be used to find messages hidden through RSA encryption, however it requires a quantum computer with more quantum bits than there are available.