RSA Encryption Slide 6 of 11

Go to slide: 1: Fermat’s Little Theorem 2: Some Modular Arithmetic Rules 3: Using Modular Arithmetic Rules 4: But Exponents are Different 5: Reducing Exponents 6: RSA Encryption 7: A Sample Usage of this Method 8: Another Sample Usage of RSA 9: The Mathematics of RSA 10: The Mathematics of RSA 11: The Mathematics of RSA