About: Computational Diffie–Hellman assumption

An Entity of Type: WikicatComputationalHardnessAssumptions, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem.The CDH assumption involves the problem of computing the discrete logarithm in cyclic groups. The CDH problem illustrates the attack of an eavesdropper in the Diffie–Hellman key exchange protocol to obtain the exchanged secret key.

Property Value
dbo:abstract
  • The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem.The CDH assumption involves the problem of computing the discrete logarithm in cyclic groups. The CDH problem illustrates the attack of an eavesdropper in the Diffie–Hellman key exchange protocol to obtain the exchanged secret key. (en)
dbo:wikiPageID
  • 1937391 (xsd:integer)
dbo:wikiPageLength
  • 6224 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1095452309 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem.The CDH assumption involves the problem of computing the discrete logarithm in cyclic groups. The CDH problem illustrates the attack of an eavesdropper in the Diffie–Hellman key exchange protocol to obtain the exchanged secret key. (en)
rdfs:label
  • Computational Diffie–Hellman assumption (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License