Discrete Logarithms - Dartmouth College

Discrete Logarithms Carl Pomerance, Dartmouth College. Suppose that G is a group and g ∈ G has finite order m. Then for each t ∈ hgi the integers n with gn = t form a residue class mod m. Denote it by logg t. The discrete logarithm problem is the computational task of ................
................