English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 54389/89220 (61%)
造訪人次 : 10568832      線上人數 : 19
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45407


    題名: An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1
    作者: Ren-junn Hwang;Feng-fu Su;Sheng-hua Shiau
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: modular multiplication;modular exponentiation;RSA cryptosystem;strong prime
    日期: 2007-07
    上傳時間: 2010-03-26 19:13:33 (UTC+8)
    出版者: International Press
    摘要: 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.
    關聯: Communications in Mathematical Sciences 5(2), 頁383-389
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    沒有與此文件相關的檔案.

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋