Rsa, Miller Rabin, Prime Numbers, Algorithms, Cryptography.
prime factors but no known algorithm that works in polynomial time. So these types of algorithms are not good for deciding if a number is prime. The Fermat Primality Test Our task is the same. We want to decide if n it is prime. The idea of the Fermat Primality Test is to test a set of properties