Math 480, Spring 2015, Assignment 6

From cartan.math.umb.edu
Revision as of 20:09, 23 March 2015 by Steven.Jackson (talk | contribs) (Created page with "__NOTOC__ ==Carefully describe the following algorithms:== # Trial and error (algorithm for calculating discrete logs). # Babystep-giantstep algorithm. ==Carefully state th...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


Carefully describe the following algorithms:[edit]

  1. Trial and error (algorithm for calculating discrete logs).
  2. Babystep-giantstep algorithm.

Carefully state the following theorems (you do not need to prove them):[edit]

  1. Time and memory complexity of the trial-and-error discrete log algorithm.
  2. Time and memory complexity of the babystep-giantstep algorithm.

Solve the following problems:[edit]

  1. Exercise 2.17(a).

Coding projects:[edit]

  1. Implement the trial-and-error algorithm. What is the largest modulus for which you can successfully compute discrete logs with this algorithm?
  2. Implement the babystep-giantstep algorithm. What is the largest modulus for which you can successfully compute discrete logs with this algorithm?
--------------------End of assignment--------------------

Questions:[edit]

Solutions:[edit]

Retrieved from "http://cartan.math.umb.edu/wiki/index.php?title=Math_480,_Spring_2015,_Assignment_6&oldid=54878"