教師資料查詢 | 類別: 期刊論文 | 教師: 黃仁俊 HWANG REN-JUNN (瀏覽個人網頁)

標題:An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1
學年95
學期2
出版(發表)日期2007/07/01
作品名稱An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1
作品名稱(其他語言)
著者Ren-junn Hwang; Feng-fu Su; Sheng-hua Shiau
單位淡江大學資訊工程學系
出版者International Press
著錄名稱、卷期、頁數Communications in Mathematical Sciences 5(2), 頁383-389
摘要Modular multiplication plays an important role to several public-key cryptosystems such as the RSA cryptosystem. This paper proposes an efficient modulo $p$ multiplication algorithm with moderate factors of $p$+1 and $p$-1. In order to improve the RSA decryption performance, users can utilize our proposed algorithm and the strong prime criterion. It will prove that the decryption method based on our proposed algorithm can run at a speed almost 6.5 times faster than that of the traditional method, or almost 2 times faster than that of the method based on the Chinese Remainder Theorem. Furthermore, the proposed algorithm can greatly enhance the performance of RSA encryption.
關鍵字modular multiplication; modular exponentiation; RSA cryptosystem; strong prime
語言英文
ISSN1539-6746
期刊性質國外
收錄於SCI
產學合作
通訊作者
審稿制度
國別美國
公開徵稿
出版型式紙本
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!