This algorithm is often paired with OAEP, which makes it probabilistic by adding random oracles. Now implemented via the PCKS scheme, modern versions use the Carmichael function. One pair of values generated have a product congruent to 1 modulo lambda of n. One step involves computing the totient of the product of two numbers and finding an integer that is coprime to that result. Another step in this algorithm is to find the modular multiplicative inverse of e, and the efficacy of this algorithm is proven by Fermat's Little Theorem. Its secure because of the difficulty in factoring large primes. For 10 points, name this public key encryption algorithm pioneered at MIT by the three scientists whose initials give it i
This algorithm is often paired with OAEP, which makes it probabilistic by adding random oracles. Now implemented via the PCKS scheme, modern versions use the Carmichael function. One pair of values generated have a product congruent to 1 modulo lambda of n. One step involves computing the totient of the product of two numbers and finding an integer that is coprime to that result. Another step in this algorithm is to find the modular multiplicative inverse of e, and the efficacy of this algorithm is proven by Fermat's Little Theorem. Its secure because of the difficulty in factoring large primes. For 10 points, name this public key encryption algorithm pioneered at MIT by the three scientists whose initials give it its name.
This algorithm is often paired with OAEP, which makes it probabilistic by adding random oracles.
 RSA encryption [or Rivest, Shamir and Adleman]