Computational hardness assumptions
Computational Diffie–Hellman assumptionComputational hardness assumptionDecision Linear assumptionDecisional Diffie–Hellman assumptionDecisional composite residuosity assumptionDiffie–Hellman problemDiscrete logarithmDiscrete logarithm recordsExponential time hypothesisHigher residuosity problemInteger factorizationLattice problemPhi-hiding assumptionPlanted cliqueQuadratic residuosity problemRSA problemRing learning with errorsSecurity levelShort integer solution problemStrong RSA assumptionSub-group hidingUnique games conjectureXDH assumption
Link from a Wikipage to another Wikipage
Computational Diffie–Hellman assumptionComputational hardness assumptionDecision Linear assumptionDecisional Diffie–Hellman assumptionDecisional composite residuosity assumptionDiffie–Hellman problemDiscrete logarithmDiscrete logarithm recordsExponential time hypothesisHigher residuosity problemInteger factorizationLattice problemPhi-hiding assumptionPlanted cliqueQuadratic residuosity problemRSA problemRing learning with errorsSecurity levelShort integer solution problemStrong RSA assumptionSub-group hidingUnique games conjectureXDH assumption
subject
Computational hardness assumptions
Wikipage page ID
10,967,056
Wikipage revision ID
487,222,318
type
label
Computational hardness assumptions
@en
broader
prefLabel
Computational hardness assumptions
@en