Discrete logarithm: Revision history

From Polymath Wiki
Jump to navigationJump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

19 August 2009

8 August 2009

  • curprev 11:5711:57, 8 August 2009‎ Teorth talk contribs‎ 756 bytes +756‎ New page: The discrete logarithm problem is this: given a prime p, a generator g, and another non-zero residue class a mod p, find an integer n such that <math>g^n = a \hbox{ mod } p</math>. This p...
Retrieved from "https://michaelnielsen.org/polymath/index.php?title=Discrete_logarithm"