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 if there exist certain...

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...

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

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

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

In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by Impagliazzo...

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

(2002-09-13). "Computational Complexity Blog: Complexity Class of the Week: Factoring". Goldreich, Oded; Wigderson, Avi (2008), "IV.20 Computational Complexity"...

In cryptography, the strong RSA assumption states that the RSA problem is intractable even when the solver is allowed to choose the public exponent e (for...

The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography. It was first...

known as a unique game, has NP-hard computational complexity. It has broad applications in the theory of hardness of approximation. If the unique games...

basis for extremely secure cryptographic schemes. The use of worst-case hardness in such schemes makes them among the very few schemes that are very likely...

1-vs-2 cycles conjecture or 2-cycle conjecture is an unproven computational hardness assumption asserting that solving the 1-vs-2 cycles problem in the massively...

tighter bound on the hardness assumption of SIS. This makes assuming the hardness of M-SIS a safer, but less efficient underlying assumption when compared to...

a construction of iO based on a computational hardness assumption relating to multilinear maps, but this assumption was later disproven. A construction...

currently computationally infeasible; this assumption is required for the security of the RSA cryptosystem. The Φ-hiding assumption is a stronger assumption, namely...

Linear (DLIN) assumption is a computational hardness assumption used in elliptic curve cryptography. In particular, the DLIN assumption is useful in settings...

science practice; cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in actual practice by...

format Decision composite residuosity in cryptography, see Computational hardness assumption Design change request, also document change request and database...

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...

In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms...

OAEP, to protect against such structural problems in RSA. Strong RSA assumption RSA Factoring Challenge Rabin cryptosystem, whose equivalency to factoring...

effective method for finding discrete logarithms, consists of four large computational steps, of which the first three depend only on the order of the group...

conjecture has been used as a computational hardness assumption to prove the difficulty of several other problems in computational game theory, property testing...

decisional composite residuosity assumption (DCRA) is a mathematical assumption used in cryptography. In particular, the assumption is used in the proof of the...

game theory, machine learning, computational biology, computational economics, computational geometry, and computational number theory and algebra. Work...

In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time...