In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where...

The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem. The CDH assumption involves...

The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic...

Diffie–Hellman (XDH) assumption is a computational hardness assumption used in elliptic curve cryptography. The XDH assumption holds that there exist...

public-key cryptography, such as ElGamal, base their security on the hardness assumption that the discrete logarithm problem (DLP) over carefully chosen groups...

called the planted clique conjecture; it has been used as a computational hardness assumption. A clique in a graph is a subset of vertices, all of which...

small set expansion conjecture in computational complexity theory is an unproven computational hardness assumption. Under the small set expansion hypothesis...

security level isn't set at design time, but represents a computational hardness assumption, which is adjusted to match the best currently known attack...

which a sport is played Hardtack Hardware (disambiguation) Computational hardness assumption This disambiguation page lists articles associated with the...

group element, given g, gx, and gy. Sometimes the DHP is called the computational Diffie–Hellman problem (CDHP) to more clearly distinguish it from the...