Math Is Fun Forum

sam123

Guest

cryptography-discrete log problem

(c)(i) State the discrete logarithm problem for G.
(ii) If |G| is large, does this guarantee that the discrete logarithm problem is hard? Justify your answer.

Btw, G is a finite cyclic group here.

(i) We know G is a finite cyclic group, let ''a'' be a generator of G. let ''b'' be an element of G. Given a and b, finding x for a^x=b is the discrete logarithm problem for G, where x={0,1,2,...,|G|-1}

(ii) Need some help with this bit thanks!