Homework 7, due on the date listed on the schedule page
Solve 2x = 12 (mod 19) using the Pollig-Hellman method.
Do the following written problems from Trappe and Washington,
section 7.6: (show your work): 5a, 6, 8, 10, 11, 12.
On 12a, assume gcd(c, n) = 1 (otherwise the second list cannot be computed)
BONUS: Will be a problem in which you try to factor a really large number using any software
you can find. Number TBA.
Submit the code you used (in the dropbox) and your results (on paper).