Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Diffie–Hellman_problem> ?p ?o }
Showing triples 1 to 59 of
59
with 100 triples per page.
- Diffie–Hellman_problem abstract "The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use mathematical operations that are fast to compute, but hard to reverse. For example, they enable encrypting a message, but reversing the encryption is difficult. If solving the DHP were easy, these systems would be easily broken.".
- Diffie–Hellman_problem wikiPageExternalLink diffie76new.html.
- Diffie–Hellman_problem wikiPageExternalLink 306.
- Diffie–Hellman_problem wikiPageExternalLink DDH.ps.gz.
- Diffie–Hellman_problem wikiPageExternalLink BreChePoi02b.pdf.
- Diffie–Hellman_problem wikiPageExternalLink r74n758123752440.
- Diffie–Hellman_problem wikiPageExternalLink CGDH.PS.
- Diffie–Hellman_problem wikiPageID "3237741".
- Diffie–Hellman_problem wikiPageLength "7236".
- Diffie–Hellman_problem wikiPageOutDegree "25".
- Diffie–Hellman_problem wikiPageRevisionID "676193775".
- Diffie–Hellman_problem wikiPageWikiLink CRYPTO.
- Diffie–Hellman_problem wikiPageWikiLink Category:Computational_hardness_assumptions.
- Diffie–Hellman_problem wikiPageWikiLink Category:Finite_fields.
- Diffie–Hellman_problem wikiPageWikiLink Computational_Diffie–Hellman_assumption.
- Diffie–Hellman_problem wikiPageWikiLink Cryptography.
- Diffie–Hellman_problem wikiPageWikiLink Dan_Boneh.
- Diffie–Hellman_problem wikiPageWikiLink Decisional_Diffie–Hellman_assumption.
- Diffie–Hellman_problem wikiPageWikiLink Diffie-Hellman_key_exchange.
- Diffie–Hellman_problem wikiPageWikiLink Diffie–Hellman_key_exchange.
- Diffie–Hellman_problem wikiPageWikiLink Discrete_logarithm.
- Diffie–Hellman_problem wikiPageWikiLink Discrete_logarithm_problem.
- Diffie–Hellman_problem wikiPageWikiLink EUROCRYPT.
- Diffie–Hellman_problem wikiPageWikiLink ElGamal_encryption.
- Diffie–Hellman_problem wikiPageWikiLink Elliptic_curve.
- Diffie–Hellman_problem wikiPageWikiLink Eurocrypt.
- Diffie–Hellman_problem wikiPageWikiLink Finite_field.
- Diffie–Hellman_problem wikiPageWikiLink Gene_Tsudik.
- Diffie–Hellman_problem wikiPageWikiLink Generating_set_of_a_group.
- Diffie–Hellman_problem wikiPageWikiLink Group_(mathematics).
- Diffie–Hellman_problem wikiPageWikiLink International_Cryptology_Conference.
- Diffie–Hellman_problem wikiPageWikiLink Lecture_Notes_in_Computer_Science.
- Diffie–Hellman_problem wikiPageWikiLink Martin_Hellman.
- Diffie–Hellman_problem wikiPageWikiLink Multiplicative_group.
- Diffie–Hellman_problem wikiPageWikiLink Pairing.
- Diffie–Hellman_problem wikiPageWikiLink Richard_J._Lipton.
- Diffie–Hellman_problem wikiPageWikiLink Selected_Areas_in_Cryptography.
- Diffie–Hellman_problem wikiPageWikiLink Ueli_Maurer_(cryptographer).
- Diffie–Hellman_problem wikiPageWikiLink Whitfield_Diffie.
- Diffie–Hellman_problem wikiPageWikiLinkText "DH problem".
- Diffie–Hellman_problem wikiPageWikiLinkText "Diffie–Hellman problem".
- Diffie–Hellman_problem wikiPageWikiLinkText "Diffie–Hellman problem".
- Diffie–Hellman_problem wikiPageWikiLinkText "computational Diffie–Hellman problem".
- Diffie–Hellman_problem hasPhotoCollection Diffie–Hellman_problem.
- Diffie–Hellman_problem wikiPageUsesTemplate Template:Cite_journal.
- Diffie–Hellman_problem wikiPageUsesTemplate Template:Portal.
- Diffie–Hellman_problem wikiPageUsesTemplate Template:Refbegin.
- Diffie–Hellman_problem wikiPageUsesTemplate Template:Refend.
- Diffie–Hellman_problem subject Category:Computational_hardness_assumptions.
- Diffie–Hellman_problem subject Category:Finite_fields.
- Diffie–Hellman_problem comment "The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use mathematical operations that are fast to compute, but hard to reverse. For example, they enable encrypting a message, but reversing the encryption is difficult. If solving the DHP were easy, these systems would be easily broken.".
- Diffie–Hellman_problem label "Diffie–Hellman problem".
- Diffie–Hellman_problem sameAs فرض_دیفی-هیلمن.
- Diffie–Hellman_problem sameAs Problema_Diffie–Hellman.
- Diffie–Hellman_problem sameAs m.090f_k.
- Diffie–Hellman_problem sameAs Q5275394.
- Diffie–Hellman_problem sameAs Q5275394.
- Diffie–Hellman_problem wasDerivedFrom Diffie–Hellman_problem?oldid=676193775.
- Diffie–Hellman_problem isPrimaryTopicOf Diffie–Hellman_problem.