The Miller-Rabin algorithm determines whether an input is one of these values.
A series of these values is the output generated by Shor's algorithm, which works in polynomial time on quantum computers. The Miller-Rabin algorithm determines whether an input is one of these values. A modulus that is the product of two of these values is computed in both the public and private keys in RSA encryption. Carmichael numbers fool probabilistic algorithms that try to find these values using Fermat's Little Theorem. For 10 points, the Sieve of Eratosthenes is one method of finding what numbers whose only factors are one and themselves?
A series of these values is the output generated by Shor's algorithm, which works in polynomial time on quantum computers.
prime numbers [or primes; accept prime factors before "Miller-Rabin"]