|  |  D.12.3.14 babyGiant Procedure from librarycrypto.lib(see  crypto_lib).
 
Example: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.
 |  | LIB "crypto.lib";
bigint b=2;
bigint y=10;
bigint p=101;
babyGiant(b,y,p);
==> 25
 | 
 
 |