An improved attack algorithm for discrete logarithm problem
一个改进的离散对数问题攻击算法

Baby-step-giant-step attack algorithm is universally suitable to solve all discrete logarithm problems,but its relatively larger storage cost is an obvious defect.An improved attack algorithm which can cut down half of space spending and cancel the inversing-computation on multiplicative group was presented.By using hash function,this new algorithm abolishes list-sorting process and drops the time complexity of list-searching into O(1).The performance analysis shows that the new algorithm obviously reduces the time and space use.Furthermore,how to play down the input size to shorten computation journey of attack algorithms was discussed and an easy way to parity sieve for discrete logarithm was given.