A Faster Algorithm of Modular Exponentiation in RSA
Yonglong Luo · Mini-micro Systems · 2004
The main operation in RSA is modular exponentiation ( ae mod N),The tradition algorithm of modular exponentiation does the iterative computation according to the binary of exponent; The algorithm which uses base 2k shortens the sequence length and reduces the iteration number accordingly; This paper introduces an improved algorithm which is based on 2k; analyzes and compares the efficiency of the relevant algorithms; The experimental data shows that the improved algorithm is very efficient.