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

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

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

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

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

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

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

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

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

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

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

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

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

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

be difficult. However, as of 2011 no tight reduction to a computational hardness assumption is known. The signer must be careful to choose a different...

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

used computational hardness assumption, it is NP-hard to approximate the problem to within any constant factor in polynomial time. The same hardness result...

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

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

1801. This problem is believed to be computationally difficult. Several cryptographic methods rely on its hardness, see § Applications. An efficient algorithm...

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

products of two large primes. Its security can be reduced to the computational hardness assumption that integer factorization is infeasible.[BBS] Blum is also...

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

format Decision Composite Residuosity in cryptography, see Computational hardness assumption Design Change request, also Document Change request and Database...

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

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