Computational hardness assumption
In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood.
Wikipage redirect
Black-box obfuscationCiphertext indistinguishabilityCoding theoryComputational Diffie–Hellman assumptionComputational hardness assumptionsComputational securityConjunctive queryCryptographyDCRDecision Linear assumptionDecisional Diffie–Hellman assumptionDual EC DRBGElGamal signature schemeElliptic-curve cryptographyExponential time hypothesisGeneric group modelHash-based cryptographyIndex of cryptography articlesIndistinguishability obfuscationJohn_Forbes_Nash_Jr.Key sizeLattice-based cryptographyLattice (group)Learning with errorsLenore BlumNP/polyNoisy-storage modelPURB (cryptography)Planted cliqueProvable securityPseudorandom number generatorQuadratic residueQuadratic residuosity problemRSA (cryptosystem)Secure channelSecurity levelTheoretical computer scienceTime complexityXDH assumption
Link from a Wikipage to another Wikipage
primaryTopic
Computational hardness assumption
In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood.
has abstract
En cryptographie, une hypothès ...... t étudiée par la cryptanalyse.
@fr
In computational complexity th ...... ess assumption such as P ≠ NP.
@en
في علم التعمية، أو علم التشفير ...... العملية أن مشكلات معينة صعبة.
@ar
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,014,299,389
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
type
comment
En cryptographie, une hypothès ...... stes en disposent en pratique.
@fr
In computational complexity th ...... lem that is better-understood.
@en
في علم التعمية، أو علم التشفير ...... العملية أن مشكلات معينة صعبة.
@ar
label
Computational hardness assumption
@en
Hypothèse calculatoire
@fr
فرض صعوبة الحساب
@ar