【摘要】 针对DSA数字签名算法,提出了一种利用预计算建表技术提高DSA签名验证速度的方法,给出了具体的算法并做出相应的算法复杂度分析,它也能适用于某些底固定的双指数模幂运算。与目前较常用的方法相比,该方法验证速度要快一倍以上,可在计算效率与存储量之间达到某种平衡,使该方法能较好适用于某些应用场合,给出并分析了相应的实例。更多还原

【Abstract】 A precomputation table method for speeding up the DSA verify is presented, and the concrete algorithms and its complexity analyzing are also given. It is suitable for computing modular double exponentiation of fixed base. It is over one time faster than the normal methods and obtain balance between the efficiency and memory. The method is much suitable for certain occasions. Some application instances are also given accordingly.更多还原