Security, Cryptograhy, Diffie Hellman, Cyclic Group, Learning.
point. All finite fields with multiplicative groups are cyclic. Going back to our equation g^y = x mod p, the problem is only difficult if: g is a base generator in some cyclic group p p is a prime number that has the true security, of some number n, n / 2 bits (compared to RSA which needs