baby_step_giant_step
Compute discrete logarithms in modular arithmetic using the Baby-step Giant-step algorithm to solve equations of the form g^x ≡ h (mod n).
Instructions
Solve discrete logarithm using Baby-step Giant-step algorithm. (Domain: arithmetic, Category: modular_arithmetic)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| g | Yes | ||
| h | Yes | ||
| n | Yes |