UNSOLVED PROBLEMS |

In Number Theory, Logic, and Cryptography |

Diffie-Hellman Problem |

The Diffie-Hellman problem is central to modern cryptography, and is crucial to Internet security.
Suppose Alice has a private key a, and Bob has a private key b. Both make their public keys, p
The Diffie-Hellman problem is, can an adversary who knows both of the public keys, p
For further information, please see: [1] http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_problem [2] http://crypto.stanford.edu/~dabo/abstracts/DDH.html [3] http://cseweb.ucsd.edu/~cdcash/dh.pdf
You can check for contributions to this problem on the solutions page.
——————————–- This web site developed and maintained by Tim S Roberts Email: timro21@gmail.com |