English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 60868/93650 (65%)
造访人次 : 1144114      在线人数 : 91
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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 ©   - 回馈