baby_giant_step
Solves the discrete logarithm problem by finding x where base^x = target mod modulus using the baby-step giant-step algorithm.
Instructions
Solve the discrete logarithm problem (find x such that base^x = target mod modulus) using baby-step giant-step.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"base": "<base>",
"target": "<target>",
"modulus": "<modulus>"
},
"name": "baby_giant_step"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| base | Yes | Base of the exponentiation | |
| target | Yes | Target value | |
| modulus | Yes | Modulus (max 1,000,000,000) |