The difficulty in solving the discrete logarithm problem (DLP) is very important to the cryptography since it is widely used in signature schemes, message encryption, authentication, and so on. The baby-step giant-step algorithm is a series of well-defined steps to compute the discrete logarithm, but its gigantic storage cost is an obvious disadvantage. The paper designs a new algorithm to compute the discrete logarithm, the method of improved algorithm is similar to the two-dimensional matrix, in which each rows only computes the first value, by this way it can solve DLP. Compare with the original algorithm, the algorithm reduce a lot of time and space spending.
['Jun Zhang', 'LiQun Chen']
An Improved Algorithm for Discrete Logarithm Problem