Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Computational hardness assumption
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Hypothesis in computational complexity theory
Property
Value
dbo:
description
hypothesis in computational complexity theory
(en)
dbo:
wikiPageWikiLink
dbr
:Discrete_logarithm
dbr
:P_versus_NP_problem
dbr
:NTRUSign
dbr
:Multilinear_map
dbr
:Cryptographic_primitive
dbr
:Composite_number
dbr
:Paillier_cryptosystem
dbr
:Goldwasser–Micali_cryptosystem
dbr
:Post-quantum_cryptography
dbr
:Okamoto–Uchiyama_cryptosystem
dbr
:Group_(mathematics)
dbr
:Public-key_cryptography
dbc
:Computational_hardness_assumptions
dbr
:Decisional_Diffie–Hellman_assumption
dbr
:Computational_geometry
dbr
:ElGamal_encryption
dbr
:Semidefinite_programming
dbr
:Worst-case_complexity
dbr
:Quadratic_residuosity_problem
dbr
:Cryptography
dbc
:Theory_of_cryptography
dbr
:Exponential_time_hypothesis
dbr
:Rabin_cryptosystem
dbr
:Diffie–Hellman_key_exchange
dbr
:Benaloh_cryptosystem
dbr
:Complete_(complexity)
dbr
:Falsifiability
dbr
:Uriel_Feige
dbr
:Euler's_totient_function
dbr
:Computational_complexity_theory
dbr
:Boolean_satisfiability_problem
dbr
:One-time_pad
dbr
:Complexity_class
dbr
:Reduction_(complexity)
dbr
:Private_information_retrieval
dbr
:NTRUEncrypt
dbr
:Security_level
dbr
:NTRU
dbr
:Naccache–Stern_cryptosystem
dbr
:Unique_games_conjecture
dbr
:Erdős–Rényi_model
dbr
:Average-case_complexity
dbr
:Expander_graph
dbr
:NP-hardness
dbr
:Time_complexity
dbr
:Homomorphic_encryption
dbr
:List_of_PPAD-complete_problems
dbr
:List_of_PSPACE-complete_problems
dbr
:Provable_security
dbr
:Decisional_composite_residuosity_assumption
dbc
:Computational_number_theory
dbr
:Tate_pairing
dbr
:RSA_cryptosystem
dbr
:Computational_Diffie–Hellman_assumption
dbr
:Lattice-based_cryptography
dbr
:Lattice_problem
dbr
:Planted_clique
dbr
:Learning_with_errors
dbr
:Weil_pairing
dbr
:Polynomial_time
dbr
:Functional_encryption
dbr
:Boneh-Franklin_scheme
dbr
:Indistinguishability_obfuscation
dbr
:Boneh–Lynn–Shacham
dbr
:Bilinear_mapping
dbr
:Unique_Games_Conjecture
dbr
:Blum_Blum_Shub_generator
dbr
:Parametrized_complexity
dbr
:Information_theoretic_security
dbp:
wikiPageUsesTemplate
dbt
:Main
dbt
:Reflist
dbt
:See_also
dbt
:Harvtxt
dbt
:Computational_hardness_assumptions
dbt
:Short_description
dct:
subject
dbc
:Computational_hardness_assumptions
dbc
:Theory_of_cryptography
dbc
:Computational_number_theory
rdfs:
label
Computational hardness assumption
(en)
فرض صعوبة الحساب
(ar)
Hypothèse calculatoire
(fr)
Suposições de dificuldade computacional
(pt)
rdfs:
seeAlso
dbr
:Best
dbr
:The_Worst
dbr
:Best,_worst_and_average_case
owl:
sameAs
freebase
:Computational hardness assumption
yago-res
:Computational hardness assumption
wikidata
:Computational hardness assumption
dbpedia-fr
:Computational hardness assumption
dbpedia-pt
:Computational hardness assumption
dbpedia-ar
:Computational hardness assumption
dbpedia-global
:Computational hardness assumption
prov:
wasDerivedFrom
wikipedia-en
:Computational_hardness_assumption?oldid=1276234668&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:Computational_hardness_assumption
is
dbo:
wikiPageDisambiguates
of
dbr
:Hard
is
dbo:
wikiPageRedirects
of
dbr
:Computational_hardness_assumptions
dbr
:Computational_security
is
dbo:
wikiPageWikiLink
of
dbr
:Noisy-storage_model
dbr
:Lattice_(group)
dbr
:Elliptic-curve_cryptography
dbr
:Decisional_Diffie–Hellman_assumption
dbr
:Quadratic_residue
dbr
:Pseudorandom_number_generator
dbr
:XDH_assumption
dbr
:DCR
dbr
:Quadratic_residuosity_problem
dbr
:Cryptography
dbr
:Dual_EC_DRBG
dbr
:ElGamal_signature_scheme
dbr
:Feedback_arc_set
dbr
:Exponential_time_hypothesis
dbr
:Index_of_cryptography_articles
dbr
:Hard
dbr
:Theoretical_computer_science
dbr
:Lenore_Blum
dbr
:John_Forbes_Nash_Jr.
dbr
:Security_level
dbr
:Coding_theory
dbr
:RSA_(cryptosystem)
dbr
:Time_complexity
dbr
:Provable_security
dbr
:Decision_Linear_assumption
dbr
:Conjunctive_query
dbr
:Integer_factorization
dbr
:Computational_Diffie–Hellman_assumption
dbr
:Lattice-based_cryptography
dbr
:Lattice_problem
dbr
:Planted_clique
dbr
:Learning_with_errors
dbr
:Hash-based_cryptography
dbr
:NP/poly
dbr
:PURB_(cryptography)
dbr
:Black-box_obfuscation
dbr
:Indistinguishability_obfuscation
dbr
:Computational_hardness_assumptions
dbr
:Computational_security
is
foaf:
primaryTopic
of
wikipedia-en
:Computational_hardness_assumption
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International