# Daily Archives: April 4, 2008

# The RSA Theorem

Let and be distinct primes, and let satisfy . Then for any , . For some reason, even in published works, this important cryptographic result is often only half proved. Here is a full proof. Proof: We consider two cases:

# The RSA Theorem

Let and be distinct primes, and let satisfy . Then for any , . For some reason, even in published works, this important cryptographic result is often only half proved. Here is a full proof. Proof: We consider two cases: