Euclidean algorithm
- f（a,b） = f(b,a mod b)
- Example:
- The greatest common divisor problem
RSA encryption algorithm
- Traditional password
- Modern cryptography
- Symmetric encryption
- Asymmetric encryption
- RSA encryption algorithm is an asymmetric encryption