Elliptic Curve, Diffie Hellman, Discrete Log, Elgamal Encryption.
message so that it will be based on the discrete log problem. Here is an algorithm to help them out. Let Alice choose a prime p and primitive root g (mod p). She then chooses an x such that 2≤x≤p-2 and calculates nonzero residue of g^x (mod p) calling it h. Now, Bob receives g, p and h, and he