UNSOLVED PROBLEMS |

In Number Theory, Logic, and Cryptography |

Discrete Logarithm Problem |

Suppose that we have an equation y = g and that g and p are very large prime numbers, say, greater than 100 digits. Given g, p, and x, it takes a modern-day computer only a fraction of a second to calculate y.
The Discrete Logarithm Problem (DLP), is, given g, p, and y, can we find x, even if we have a million computers and a million years at our disposal?
For further information, please see: [1] http://en.wikipedia.org/wiki/Discrete_logarithm [2] http://www.cs.toronto.edu/~cvs/dlog/ [3] http://mathworld.wolfram.com/DiscreteLogarithm.html
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 |