ASIA unversity:Item 310904400/18910
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105277 (86%)
Visitors : 8144017      Online Users : 1819
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/18910


    Title: Further Refinement of Pairing Computation Based on Miller''s Algorithm
    Authors: 劉兆樑;Liu, Chao-Liang
    Contributors: 資訊多媒體應用學系
    Date: 2007-01
    Issue Date: 2012-11-26 15:10:31 (UTC+8)
    Abstract: In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate pairings. In this paper we extend their work and propose a generalized algorithm, which integrates their first two algorithms. Our approach is to pre-organize the binary representation of the involved integer to the best cases of Blake’s algorithms. Further, our refinement is more suitable for Solinas numbers than theirs. We analyze our algorithm and show that our refinement has better performance than the original algorithms.
    Relation: APPLIED MATHEMATICS AND COMPUTATION
    Appears in Collections:[Department of Applied Informatics and Multimedia] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML87View/Open


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


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