ASIA unversity:Item 310904400/13207
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90120/105277 (86%)
造访人次 : 8144249      在线人数 : 2039
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/13207


    题名: Further Refinement of Pairing Computation Based on Miller’s Algorithm
    作者: 劉兆樑;Liu, Chao-Liang
    贡献者: 資訊多媒體應用學系
    日期: 2006
    上传时间: 2012-11-22 16:55:57 (UTC+8)
    摘要: 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.
    關聯: Proc. of the sixteenth National Conference on Information Security
    显示于类别:[行動商務與多媒體應用學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML58检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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