English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23029432      Online Users : 336
RC Version 7.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
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/31791

    Title: Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
    Authors: Yen,Sung-Ming;Lien,Wei-Chih;Moon,SangJae
    Contributors: 資訊工程研究所
    Keywords: CRYPTOGRAPHY
    Date: 2007
    Issue Date: 2010-07-06 18:11:39 (UTC+8)
    Publisher: 中央大學
    Abstract: In order to speed up long integer modular multiplication and modular exponentiation computations that play the most important role of implementing public-key cryptographic systems, recently a result has been reported by developing a binary complement base
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明