The correct option is (c) Diffie-Hellman key exchange
Explanation: A discrete logarithm modulo of an integer to the base is an integer such that a^x ≡ b (mod g). The problem of computing the discrete logarithm is a well-known challenge in the field of cryptography and is the basis of the cryptographic system i.e., the Diffie-Hellman key exchange.