Baby-step giant-step Guide, Meaning , Facts, Information and Description
The baby-step giant-step algorithm can be used to solve the discrete logarithm problem.Let G be a finite cyclic group and let x be a generator of G. We wish to compute logx(y) for some y. We first make a guess N of logx(y). (Guessing N=|G| is fine.) Then, the values , where , are computed and hashed. Then, we loop through the values for . For each , we compute and look it up in our hash table. If is found to equal , then and , and logx(y)=j+ik.
This algorithm has complexity .
This is an Article on Baby-step giant-step. Page Contains Information, Facts Details or Explanation Guide About Baby-step giant-step