|
D.12.3.16 babyGiant
Procedure from library crypto.lib (see crypto_lib).
- Usage:
- babyGiant(b,y,p);
- Return:
- the discrete logarithm x: b^x=y mod p
- Note:
- This procedure works based on Shank's baby step - giant step method.
Example:
| LIB "crypto.lib";
ring R = 0,z,dp;
number b=2;
number y=10;
number p=101;
babyGiant(b,y,p);
==> 25
|
|