Cryptography, Algorithms, Public Key Cryptography.
build a cyclic field. Let that be m=11 and the associated field be F(11). As per algorithm, he selects a=3(gcd(3, 11) = 1) and g=7. Now he calculates the public key to be, h = 7³ mod 11 = 2 and sends the tuple <F(11), 2, 11, 7>. Alice, on the other end, picks her private key k = 5 (gcd(5, 11 = 1)