RSA Encryption

• The RSA algorithm was invented by Ronald L. Rivest, Adi Shamir, and Leonard Adleman in 1977.
  • The algorithm uses prime factorization.
  • It requires two large prime numbers, known as p and q.
  • It also requires a private key d and a public key e.
  • Euler's totient function is also used.
    • Defined as the number of positive integers that are relatively prime a number, known as n.

• RSA encryption is best explained with an interactive exercise.

Let us review this chapter.

---

---

© 2006 John Michael Pierobon

Notes