Discrete Logarithm Solver
Search for x where g^x ≡ h (mod p) within practical teaching-size limits. Processing takes place locally in your browser.
Start using
What Discrete Logarithm Solver does
Search for x where g^x ≡ h (mod p) within practical teaching-size limits.
Worked example
Input
2^x ≡ 8 (mod 13)
Result
x = 3
Calculation method
The solver uses bounded search or a method such as baby-step giant-step over the selected modular group.
Useful workflows
- Check a small teaching example and inspect intermediate results.
- Compare an independently calculated answer or software test fixture.
- Copy the result together with its input notation and selected options.
Limits and review checks
- Combinatorial, graph and search problems can grow exponentially and are intentionally size-limited.
- Confirm integer, modular, set-order, precision and rounding assumptions before comparing answers.
- Cryptography-related pages are educational demonstrations and must not generate or validate production security keys.
Frequently asked questions
Why is my input rejected?
Check separators, variable names, supported operators, numeric ranges and whether the selected algorithm requires integers.
Can I use this result in a high-stakes decision?
Use the tool for learning and independent checks. Verify legal, financial, safety or security decisions with an authoritative method and qualified reviewer.
Processing takes place locally in your browser.