CDH Problem states that given \((g, g^x \mod p, g^y \mod p)\), find \(g^{xy} \mod p\). Based on the CDH assumption, it is generally a hard problem to solve (other than being solved by Discrete Logarithms (DLOG)#). Many asymmetric cryptographic scheme depends on CDH security guarantee.