Rsa, Miller Rabin, Prime Numbers, Algorithms, Cryptography.
a tremendous amount of time as the number of digits increases. This is how long it takes to do it in python. A number with k digits has magnitude around 10 to the power of k. So the algorithm runs in exponential time with respect to the number of digits. There are better algorithms for finding