Baby-Step 2^k-ary Adult-Step Algorithm for Symmetric-Key Decryption

The baby-step giant-step algorithm seeks in a discrete logarithm problem when of are already given. It does so by dividing by block of length and letting one giant walk straight toward with constant strides in search for . In this paper, I basically reduce to and replace a giant with an adult who is designed to walk straight with constant strides. I also extend the algorithm to allow adults to walk simultaneously. As a consequence, the proposed algorithm quarters the execution time of the basic adult-walk method when applied to in the range of In conclusion, the proposed algorithm greatly shorten the step number of baby-step giant-step.