Improvement of modular multiplication algorithm based on sliding window

Abstract

The paper makes a conclusion that the key to increase the speed of large number modular multiplication is not only to decrease the time of addition, but also to decrease the time of circulation shift. According to the analysis of the principle implement and time complexity of sliding window algorithm which is more speed, it presents a improving method about sliding window algorithm to decrease the time of addition and circulation shift by decreasing the judgment on carry sign and increasing the width of one circulation shift and implements the high speed calculation of modular multiplication algorithm.