The Mathematics of Public-Key Cryptography, Lecture 1

September 14, 2000

Reference

• read sections 4.1 - 4.3 of the textbook for background

Summary of material covered in lecture 2

• Euclidean algorithm
  • computation of gcd's
  • extended Euclidean algorithm
  • computation of multiplicative inverses
• Chinese remainder theorem
• Z_n and Z^n*
• RSA encryption and decryption operations