RSA with multiple primes
SMRTR summary
RSA encryption typically uses two large prime numbers, but mathematicians can use three or more primes instead, which allows for faster decryption through the Chinese Remainder Theorem while maintaining the same security level. Daniel Bernstein applied this concept to post-quantum cryptography by using many 4096-bit primes rather than massive terabyte-sized primes.
SMRTR provides this summary for quick context. The original article belongs to John D. Cook.
Read the original article