- A brute-force algorithm that simply tries every possibly x.
- An implementation of the Pollard-rho or baby-step-giant-step algorithm. Both algorithms can be found in the HAC.
dl-brute .
On input a file containing decimal-formatted ( p; g; h ), prints x to standard output.
dl-efficient .
On input a file containing decimal-formatted ( p; g; h ), prints x to standard output.
(Works well for 20-40bit keys)