English  |  正體中文  |  简体中文  |  Items with full text/Total items : 57397/90944 (63%)
Visitors : 13098956      Online Users : 285
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45407

    Title: An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1
    Authors: Ren-junn Hwang;Feng-fu Su;Sheng-hua Shiau
    Contributors: 淡江大學資訊工程學系
    Keywords: modular multiplication;modular exponentiation;RSA cryptosystem;strong prime
    Date: 2007-07
    Issue Date: 2010-03-26 19:13:33 (UTC+8)
    Publisher: International Press
    Abstract: 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.
    Relation: Communications in Mathematical Sciences 5(2), 頁383-389
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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