Efficient Algorithms for RSA Cryptosystem Implementation
Jinling Xu · Microprocessors · 2007
Modular exponentiation of large integers is the choke point for RSA.After analyzing traditional algorithms,a new fast modular exponentiation algorithm was presented.Wallace tree,lookup table and parallel multiplication were used in the algorithm.With theoretical analyzing and practical application,it was shown that the time complexity of the new algorithm was reduced to O(logn).