English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113303/144284 (79%)
Visitors : 50794698      Online Users : 744
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/115194


    Title: Efficient Montgomery ModularMultiplication Algorithm Using Complement and Partition Techniques
    Authors: Wu, Chia-Long
    Lou, Der-Chyuan
    Chang, Te-Jen
    Keywords: 密碼學;模運算;金鑰分割;公開金鑰;模乘法;密碼系統
    Cryptography;modular arithmetic;key partition;public-key cryptosystem;modular multiplication
    Date: 2006
    Issue Date: 2017-12-18 17:36:28 (UTC+8)
    Abstract: 針對RSA 公開金鑰演算法演進而言，正朝向發展出快速、有效的使用面積、以及低功率的蒙哥馬利模乘法器，可應用在安全交易系統中智慧卡的數位簽章與使用者認證作業上。本論文中，我們提出一個有效地可節省模乘法數的演算法，本演算法是在被乘數利用補數方法，乘數利用分割金鑰大小的方法。運由模數運算以及補數方法在蒙哥馬利演算法上，則針對RSA 密碼系統而言，所提出的方法可以有效地解決模指數的運算。我們提出的時間複雜度為k/4 + 1/2乘法量，Lee、Jeong 與Kwon 三位學者所提出的演算法則需要k/2 +1乘法量，其中k 為被乘數與乘數的位元長度。
    High-speed, area-efficient, and low-power Montgomery modular multipliers for RSA algorithm have been developed for digital signature and user authentication in high-speed network systems and smart cards. In this paper, we present an efficient algorithm for modular multiplication by performing complements on the multiplicand and partitioning the key size of the multiplier. By applying the modular arithmetic and complement technique to the Montgomery algorithm, the proposed algorithm can efficiently evaluate modular exponentiation for RSA cryptosystem. The computational complexity of the proposed algorithm is k/4 + 1/2 multiplications, which is less than k/2 + 1 multiplications in Lee-Jeong-Kwon algorithm, where k is the bit-length of the multiplicand and the multiplier.
    Relation: TANET 2006 台灣網際網路研討會論文集
    資通安全、不當資訊防治
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File Description SizeFormat
    651.pdf249KbAdobe PDF2352View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback