Discrete Logarithm Problem
Statement
If is prime and , we write if satisfies . The problem of finding such an integer for a given (with ) is the Discrete Log Problem.
Conjecture There does not exist a polynomial time algorithm to solve the Discrete Log Problem.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.