English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113961/144987 (79%)
Visitors : 51988655      Online Users : 826
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/115192


    Title: Fast Modular Squaring Method for Public-Key Cryptosystems
    Authors: Wu, Chia-Long
    Lou, Der-Chyuan
    Chang, Te-Jen
    Keywords: 模平方運算;公開金鑰密碼系統;演算法;查表法;移位
    Modular squaring;public key cryptosystem;algorithm;Look Up Table;shift
    Date: 2006
    Issue Date: 2017-12-18 17:36:01 (UTC+8)
    Abstract: 平方演算法在大整數的運算，扮演很重要的角色。標準的平方演算法眾所週知，但有“錯誤進位”的疑慮發生。Guajardo與Paar學者提出的平方演算法修正了這項缺點，但是又延生出“錯誤索引”的問題。在本篇論文中，我們提出一個有效的平方方法，不僅可以解決以上所述兩項問題，亦可改進Yang、Hseih與Laih三位學者所提出的演算法。對於基底b而言，xi * xj 的乘積可以事先計算並儲存之，即1*2, 1*3, …, (b-1)(b-1)可以在實際運算前，事先儲存之，進而加速平方演算法的執行效率。本文所提出的演算法與Yang、Hseih與Laih三位學者所提出的演算法相較之下，快了1.77倍，當然這個演算法比標準的平方法亦快的多。
    The squaring algorithm acts an important role in large integer arithmetic. The standard squaring algorithm is quite well-known, but there is an improper carry handling bug in it. The Guajardo-Paar’s squaring algorithm fixes the carry handling bug, but generates error-indexing bug. In this paper, we propose a novel efficient squaring algorithm that not only avoids the bugs between the standard squaring algorithm and the Guajardo-Paar`s squaring algorithm but also improves the performance in squaring computation for Yang-Hseih-Laih squaring algorithm. For base b, the products of xi * xj can be pre-computed on-line, that is, 1*2, 1*3, …, (b-1)(b-1) are pre-computed. Some results will be determined and stored in a look-up table before the computation and we can speed up the performance of squaring algorithm. Our proposed algorithm is about 1.77 times faster in comparison with the Yang-Hseih-Laih’s algorithm, and also faster than the standard squaring algorithm.
    Relation: TANET 2006 台灣網際網路研討會論文集
    資通安全、不當資訊防治
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File Description SizeFormat
    649.pdf204KbAdobe PDF2169View/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