期刊論文
| 學年 | 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 |
| 語言 | en |
| ISSN | 1539-6746 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | 紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45407 ) |