關鍵字查詢 | 類別:期刊論文 | | 關鍵字:An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1

[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 01 筆查詢結果
序號 學年期 教師動態
1 95/2 資訊系 黃仁俊 教授 期刊論文 發佈 An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1 , [95-2] :An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1期刊論文An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1Ren-junn Hwang; Feng-fu Su; Sheng-hua Shiau淡江大學資訊工程學系modular multiplication; modular exponentiation; RSA cryptosystem; strong primeInternational PressCommunications in Mathematical Sciences 5(2), 頁383-389Modular 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
[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 01 筆查詢結果