The Mathematics of Public-Key Cryptography, Lecture 8

September 26, 2001

Reference

• read sections 4.5 and 7.3 of the textbook for background

Summary of material covered in lecture 8

• summary of factoring algorithms and their complexity
  • trial division
  • rho algorithm
  • random squares/ quadratic sieve
  • elliptic curve
  • number field sieve
• birthday paradox
• Pollard rho algorithm for factoring: see "Notes" on the course home page