Input should be the result of two primes numbers multiplied together. (These primes could be the same or different) Afterwards put it in the machine and it will calculate what numbers you had used to make your result. Time = How long it took Attempts = How many guesses it took to find the result p = Prime 1 q = Prime 2
This algorithm is the fastest known way to find the factors of a number of two prime numbers multiplied together. This number (if the primes are ridiculously big) is what is used to protect messages between computers. However, as this algorithm is slow when it comes to big numbers (with some taking thousands of years), this method of data protection is safe, unless you are ridiculously unlucky. However, when quantum computers (really fast computers) come then it would only take 10 minutes complete this algorithm putting computers at risk. Luckily methods of data protection with quantum are being tested so, when quantum computers do come, our data will be safe.
