English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90429/105609 (86%)
Visitors : 10283540      Online Users : 72
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/100214


    Title: Speeding up Pairing Computation Using Non-adjacent Form and ELM Method
    Authors: 劉兆樑;Liu, Chao-Liang;Horng, Gwoboa;Horng, Gwoboa;Tsa, Du-Shiau;Tsai, Du-Shiau
    Contributors: 行動商務與多媒體應用學系
    Date: 2016-01
    Issue Date: 2016-08-08 14:41:12 (UTC+8)
    Abstract: The bilinear pairings such as Weil pairing and Tate pairing on elliptic curves have recently found many applications in cryptography. The first efficient algorithm for computing pairing was originally proposed by Miller and much subsequent research has been directed at many different aspects in order to improve efficiency. In 2003, Eisenträger, Lauter and Montgomery proposed a new point-double-addition method to speed up elliptic curve arithmetic computation and obtained a 7.8% performance improvement of the Miller algorithm of a general elliptic curve. In 2006, Blake et al. proposed a new concept based on the conjugate of a line to reduce the total number of lines in the Miller algorithm. In this paper we propose an enhancement of Eisenträger et al.'s algorithm for computing pairings. Our enhancement can further speed up the pairing computation by 5.9%.
    Relation: International Journal of Network Security
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML77View/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