Thursday, October 29, 2009

7.2 Computing Discrete Logs

  • The hardest part to understand was how the Pohlig-Hellman Algorithm works. It didn't make to much sense to me how we broke up x(p-1/q) into two parts.
  • I thought it was interesting to see how we can compute some logarithms using the different algorithms.

No comments:

Post a Comment