Improved Common-Multiplicand Multiplication and Fast Exponentiation by Exponent Decomposition

スポンサーリンク

概要

• 論文の詳細を見る

• The technique of common-multiplicand multi-plication, CMM, is modified and the similar approach is utilized to enhance the performance of a recently proposed fast exponentiation algorithm by exponent decomposition. On average, the improved exponentiation, its original version, and the traditional right to left binary exponentiation algorithm take 1.292m+11, 1.375m+3, and 1.5m multiplications, respectively where m is the bit length of the exponent. Finally, it is shown how to improve the overall performance of an exponentiation by employing the improved exponentiation algorithm, the improved CMM algorithm, and any general purpose fast multiplication algorithm.

• 社団法人電子情報通信学会の論文
• 1997-06-25

著者

• Yen Sung-ming

  Department Of Electrical Engineering Da-yeh Institute Of Technology

関連論文

• Improved Common-Multiplicand Multiplication and Fast Exponentiation by Exponent Decomposition

スポンサーリンク