Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Diffie–Hellman_problem> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items 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 wikiPageID "3237741".
- Diffie–Hellman_problem wikiPageRevisionID "591008601".
- 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 label "Problema Diffie–Hellman".
- Diffie–Hellman_problem sameAs Diffie%E2%80%93Hellman_problem.
- Diffie–Hellman_problem sameAs Problema_Diffie–Hellman.
- Diffie–Hellman_problem sameAs Q5275394.
- Diffie–Hellman_problem sameAs Q5275394.
- Diffie–Hellman_problem wasDerivedFrom Diffie–Hellman_problem?oldid=591008601.