Unit 2-Lecture 3-4: Euler's Theorem & RSA Public key Encryption

1 Euler’s Theorem

• Euler Function: $\phi (n)::=\ $the number of integers in [0…n),that are relatively prime to n.
• Euler Theorem: If n and k are relatively prime, then:
  $$k^{\phi (n)}=1\ mode(n)$$
• Fermat’s Little Theorem: Suppose p is a prime and k is not a
  multiple of p. Then:
  $$k^{p-1}=1\ mode(p)$$
• Computing Euler Function:
  (a)If p is a prime, then: $\phi(p^k)=p^k-p^{k-1}\ \ \ for\ k \ge 1$.
  (b)If a and b are relatively prime, then: $\phi(ab)=\phi(a)\phi(b)$.

2 RSA Public Key Encryption

---

Reference

[1] Lehman E, Leighton F H, Meyer A R. Mathematics for Computer Science[J]. 2015.