微信服务号

微信订阅号

2025年3月24日 12:21 星期一
首页 > 过刊浏览>2009年第20卷第11期 >3001-3009
PDF HTML阅读 XML下载 导出引用 引用提醒
双线性对有效计算研究进展
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.60773202, 60633030 (国家自然科学基金); the National Basic Research Program of China under Grant No.2006CB303104 (国家重点基础研究发展计划(973)); the Guangdong Provincial Scientific Research Starting Foundation for Doctors of China under Grant No.9451009101003191 (广东省博士科研启动基金)


Research and Development on Efficient Pairing Computations
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [46]
    • |
  • 相似文献 [20]
    • | | |
  • 文章评论
    参考文献
    [1]　Menezes A, Okamoto T, Vanstone S. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. on Information Theory, 1993,39(5):1639-1646.
    [2]　Frey G, Rück H. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics Computation, 1994,62(206):865-874.
    [3]　Paterson KG. Cryptography from Pairing-Advances in Elliptic Curve Cryptography. Cambridge: Cambridge University Press, 2005. 215-252.
    [4]　Miller VS. The Weil pairing and its efficient calculation. Journal of Cryptology, 2004,17(4):235-261.
    [5]　Stange KE. The Tate pairing via elliptic nets. In: Takagi T, ed. Proc. of the Pairing 2007. LNCS 4575, Berlin, Heidelberg: Springer-Verlag, 2007. 329-348.
    [6]　Barreto PSLM, Galbraith S, ó’héigeartaigh C, Scott M. Efficient pairing computation on supersingular Abelian varieties. Designs, Codes and Cryptography, 2007,42(3):239-271.
    [7]　Hess F, Smart P, Vercauteren F. The Eta pairing revisited. IEEE Trans. on Information Theory, 2006,52(10):4595-4602.
    [8]　Silverman JH. The Arithmetic of Elliptic Curves. New York: Springer-Verlag, 1986.
    [9]　Koblitz N, Menezes A. Pairing-Based cryptography at high security levels. In: Smart NP, ed. Proc. of the Cryptography and Coding. LNCS 3796, Berlin, Heidelberg: Springer-Verlag, 2005. 13-36.
    [10]　Scott M. Multiprecision integer and rational arithmetic C/C++ library. 2005. http://www.shamus.ie/
    [11]　Ben L. The pairing-based cryptography library. 2006. http://crypto.stanford.edu/pbc/
    [12]　Hu L, Dong J, Pei D. An implementation of cryptosystems based on Tate pairing. Journal of Computer Science and Technology, 2005,20(2):264-269.
    [13]　Izu T, Takagi T. Efficient computations of the Tate pairing for the large MOV degrees. In: Lee PJ, ed. Proc. of the ICISC 2002. LNCS 2587, Berlin, Heidelberg: Springer-Verlag, 2003. 283-297.
    [14]　Kobayashi T, Aoki K, Imai H. Efficient algorithms for Tate pairing. IEICE Trans. on Fundamentals, 2006,E89-A(1):134-143.
    [15]　Granger R, Smart NP. On computing products of pairings. Technical Report, CSTR-06-013, Bristol: University of Bristol, 2006. 1-11.
    [16]　Scott M. Computing the Tate pairing. In: Menezes AJ, ed. Proc. of the CT-RSA 2005. LNCS 3376, Berlin, Heidelberg: Springer-Verlag, 2005. 293-304.
    [17]　Granger R, Page D, Smart NP. High security pairing-based cryptography revisited. In: Hess F, ed. Proc. of the Algorithmic Number Theory Symp.-VII. LNCS 4076, Berlin, Heidelberg: Springer-Verlag, 2006. 480-494.
    [18]　Granger R, Page D, Stam M. On small characteristic algebraic Tori in pairing based cryptography. LMS Journal of Computation and Mathematics, 2006,9(3):64-85.
    [19]　Hu L. Compression of Tate pairings on elliptic curves. Journal of Software, 2007,18(7):1799-1805 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/1799.htm
    [20]　Galbraith S, ó’héigeartaigh C, Sheedy C. Simplified pairing computation and security implications. Journal of Mathematical Cryptology, 2007,1(3):267-281.
    [21]　Granger R, Hess F, Oyono R, Theriault N, Vercauteren F. Ate pairing on hyperelliptic curves. In: Naor M, ed. Proc. of the Advances in Cryptology?EuroCrypt 2007. LNCS 4515, Berlin, Heidelberg: Springer-Verlag, 2007. 430-447.
    [22]　Galbraith SD, Harrison K, Soldera D. Implementing the Tate pairing. In: Fieker C, ed. Proc. of the Algorithm Number Theory Symp.-V. LNCS 2369, Berlin, Heidelberg: Springer-Verlag, 2002. 324-337.
    [23]　Eisentraer K, Lauter K, Montgomery PL. Fast elliptic curve arithmetic and improved Weil pairing evaluation. In: Joye M, ed. Proc. of the CT-RSA 2003. LNCS 2612, Berlin, Heidelberg: Springer-Verlag, 2003. 343-354.
    [24]　Dimitrov VS, Imbert L, Mishra PK. Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy B, ed. Proc. of the Advances in Cryptology?Asiacrypt 2005. LNCS 3788, Berlin, Heidelberg: Springer-Verlag, 2005. 59-78.
    [25]　Zhao, CA, Zhang F, Huang J. Efficient Tate pairing computation using double-base chains. Science China Series F—Information Science, 2008,51(8):1096-1105.
    [26]　Gallant RP, Lambert RJ, Vanstone SA. Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian J, ed. Proc. of the Advances in Cryptology-Crypto 2001. LNCS 2139, Berlin, Heidelberg: Springer-Verlag, 2001. 190-200.
    [27]　Scott M. Faster pairings using an elliptic curve with an efficient endomorphism. In: Maitra S, ed. Proc. of the Progress in Cryptology?INDOCRYPT 2005. LNCS 3797, Berlin, Heidelberg: Springer-Verlag, 2005. 258-269.
    [28]　Duursma I, Lee HS. Tate pairing implementation for hyperelliptic curves y2=xp-x+d. In: Laih CS, ed. Proc. of the Advances in Cryptology?Asiacrypt 2003. LNCS 2894, Berlin, Heidelberg: Springer-Verlag, 2003. 111-123.
    [29]　Barreto PSLM, Kim HY, Lynn B, Scott M. Efficient algorithms for pairing-based cryptosystems. In: Yung M, ed. Proc. of the Advances in Cryptology?Crypto 2002. LNCS 2442, Berlin, Heidelberg: Springer-Verlag, 2002. 354-368.
    [30]　Verheul E. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann B, ed. Proc. of the Advances in Cryptology?Eurocrypt 2001. LNCS 2045, Berlin, Heidelberg: Springer-Verlag, 2001. 195-210.
    [31]　Barreto PSLM, Lynn B, Scott M. On the selection of pairing-friendly groups. In: Matsui M, ed. Proc. of the Selection Area in Cryptology?SAC 2003. LNCS 3006, Berlin, Heidelberg: Springer-Verlag, 2004. 17-25.
    [32]　Matsuda S, Kanayama N, Hess F, Okamoto E. Optimised versions of the Ate and twisted Ate pairings. In: Galbraith SD, ed. Proc. of the Cryptography and Coding 2007. LNCS 4887, Berlin, Heidelberg: Springer-Verlag, 2007. 302-312.
    [33]　Zhao CA, Zhang F, Huang J. A note on the Ate pairing. Int’l Journal Information Security, 2008,7(6):379-382.
    [34]　Lee E, Lee HS, Park CM. Efficient and generalized pairing computation on Abelian varieties. IEEE Trans. on Information Theory, 2009,55(4):1793-1803.
    [35]　Zhao CA, Zhang F, Huang J. All pairings are in a group. IEICE Trans. on Fundamentals, 2008,E91-A(10):3084-3087.
    [36]　Hess F. Pairing lattices. In: Galbraith SD, ed. Proc. of the Pairing 2008. LNCS 5209, Berlin, Heidelberg: Springer-Verlag, 2008. 18-38.
    [37]　Vercauteren F. Optimal pairings. Technical Report, 2008/096, Cryptology ePrint Archive, 2008. http://eprint.iacr.org/2008/096
    [38]　Galbraith SD, Hess F, Vercauteren F. Hyperelliptic pairing. In: Takagi T, ed. Proc. of the Pairing 2007. LNCS 4575, Berlin, Heidelberg: Springer-Verlag, 2007. 108-131.
    [39]　Galbraith SD, Lin X, Morales DJM. Pairings on hyperelliptic curves with a real model. In: Galbraith SD, ed. Proc. of the Pairing 2008. LNCS 5209, Berlin, Heidelberg: Springer-Verlag, 2008. 265-281.
    [40]　Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In: Boyd C, ed. Proc. of the ASIACRYPT 2001. LNCS 2248, Berlin, Heidelberg: Springer-Verlag, 2001. 514-532.
    [41]　Scott M, Barreto PSLM. Compressed pairings. In: Franklin M, ed. Proc. of the CRYPTO 2004. LNCS 3152, Berlin, Heidelberg: Springer-Verlag, 2004. 140-156.
    [42]　Galbraith SD, Lin X. Computing pairings using x-coordinates only. Designs, Codes and Cryptography, 2009,50(3):305-324.
    [43]　Zhang F, Safavi-Naini R, Susili W. An efficient signature scheme from bilinear pairings and its applications. In: Bao F, ed. Proc. of the PKC 2004. LNCS 2947, 2004. 277-290.
    [44]　Galbraith SD, Hess F, Vercauteren F. Aspects of pairing inversion. IEEE Trans. on Information Theory, 2008,54(12):5719-5728.
    [45]　IEEE P1363.3 Working Group. Identity-Based public key cryptography. 2006. http://grouper.ieee.org/groups/1363/IBC/index.html
    附中文参考文献: [19] Hu L. Compression of Tate pairings on elliptic curves. Journal of Software, 2007,18(7):1799-1805. http://www.jos.org.cn/1000- 9825/18/1799.htm
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

赵昌安,张方国.双线性对有效计算研究进展.软件学报,2009,20(11):3001-3009

复制
分享
文章指标
  • 点击次数:8438
  • 下载次数: 19316
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2007-12-08
  • 最后修改日期:2009-05-05
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19727817位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号