A variant of RSA where the modulus is the product of more than two primes.

RSA is typically used with a modulus n that's the product of exactly two primes. But it also works with a modulus that has more factors. Depending on the modulus size it's possible to use three to five prime factors without a loss of security. Using more factors speeds up the expensive private key operation using the Chinese remainder theorem

history | excerpt history