For 10 points, name these non-composite numbers with only two divisors, one and themselves.
If you multiply two of these values and find the Euler totient function of the product, you can create public and private keys symbolized d and e. Whether a given number is one of these values is tested using an algorithm named for Miller and Rabin. One naïve test for these values, named for Fermat, gives false positives called Carmichael numbers. The difficulty of factoring composite numbers composed of two of these numbers is the basis of RSA encryption. For 10 points, name these non-composite numbers with only two divisors, one and themselves.
If you multiply two of these values and find the Euler totient function of the product, you can create public and private keys symbolized d and e.
prime numbers [or primes]