The Mathematics of Public-Key Cryptography, Lecture 12
October 19, 2000
Summary of material covered in lecture 12
- equivalence of computing discrete logarithms in
a cyclic subgroup generated by alpha of order n to finding an isomorphism of
the subgroup with (Z_n,+)
- Shanks' algorithm for computing discrete logarithms
- the Pollard rho algorithm for computing discrete logarithms