Improvement of modular multiplication algorithm based on sliding window

Jingdong Chen; Xiangyan Fang

doi:10.1117/12.780355

10 November 2007 Improvement of modular multiplication algorithm based on sliding window

Jingdong Chen, Xiangyan Fang

Proceedings Volume 6795, Second International Conference on Space Information Technology; 67957Z (2007) https://doi.org/10.1117/12.780355
Event: Second International Conference on Spatial Information Technology, 2007, Wuhan, China

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.

Citation Download Citation

Jingdong Chen and Xiangyan Fang "Improvement of modular multiplication algorithm based on sliding window", Proc. SPIE 6795, Second International Conference on Space Information Technology, 67957Z (10 November 2007); https://doi.org/10.1117/12.780355

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available