Computing Project I - Shank's Algorithm for Primitive Roots

Assigned 16 Feb 17, Due 2 Mar 17.

Implement Shanks algorithm (baby-step, giant-step) for computing discrete logarithms in cyclic groups. Test your program by trying to compute the log of h with respect to g in F_p for these examples. Generate timing information for your computations. (I don't know the answers ... I generated this data without saving the exponents). I don't expect you will be able to compute all of them, but see how well your program performs. You can compare the performance to gp-pari. If your program does in fact successfully compute all these, generate bigger examples until your program fails.

Groups for this project:


Revised: Thu Feb 16 20:58:18 EST 2017
Paul Gunnells
gunnells at math dot umass dot edu