The Mathematics of Public-Key Cryptography, Lecture 6

September 28, 2000

Reference

• read section 4.8.2 of the textbook for background

Summary of material covered in lecture 6

• Pollard rho algorithm for factoring: see "Notes" on the course home page
• random squares algorithm for factoring
  • congruences of the form x^2 = y^2 mod n
  • factor bases
  • combining congruences to get a congruence of the desired form