期刊文献+

一种改进的在Hessian曲线上计算Tate双线性对的算法 被引量:3

An improved algorithm for computing Tate pairings on Hessian curves
下载PDF
导出
摘要 选择适当的椭圆曲线,对于快速部署和实现椭圆曲线密码系统具有重要的意义.由于Hessian形式的椭圆曲线可以运用并行算法快速实现点加和倍点运算,因此能够有效提高系统的实现效率.利用Hessian曲线上点的优良性质,简化了直线斜率的计算公式,优化了在Hessian曲线上计算Tate双线性对的算法.在其他运算量保持不变的前提下,改进后的算法使点加和倍乘运算的运算量分别降低13.43%和11.25%. The choice of appropriate elliptic curve is important for rapidly deploying and implementing elliptic curve cryptography. Hessian Elliptic Curve improve the efficiency of the system because it can run parallel algorithms to compute point addition and point doubling. This property is used to simplify the computation of slope and optimize the algorithm of calculating Tate bilinear. Under the condition that other operations are the same, the improved al- gorithm respectively cuts down 13.43% and 11.25% operations on point addition and point doubling.
作者 胡建军
出处 《浙江大学学报(理学版)》 CAS CSCD 2013年第5期539-542,共4页 Journal of Zhejiang University(Science Edition)
基金 甘肃省高等学校研究生导师科研资助项目(1113-02)
关键词 Hessian曲线 Tate双线性对 标量乘 运算量 Hessian curves Tate pairings scalar multiplication operations
  • 相关文献

参考文献3

二级参考文献58

  • 1LeiHu,Jun-WuDong,Ding-YiPei.Implementation of Cryptosystems Based on Tate Pairing[J].Journal of Computer Science & Technology,2005,20(2):264-269. 被引量:8
  • 2T Izu, T Takagi. Efficient computation of the Tate pairing for the Large MOV degree [ A ]. ICISC2002 [ C ]. Berlin Heidel berg: Springer-Verlag, 2003. 283 - 297.
  • 3S Chatterjee, P Sarkar, R Barua. Efficient computation of tate pairing in projective coordinate over ceneral characteristic fields [ A ]. Information Security and Cryptolgy [ C ]. I- CISC2004, Berlin Heidelberg: Springer-Verlag, 2005, 168 - 181.
  • 4P S L M Barreto, S Galbraith, C Eigeartaigh, M Scott. Effi cient pairing computation on supersingular abelian varieties [OL]. Codes and Cryptography, Cryptology eprint Atchives, http://eprint, iacr. org, 2004/375. pdf.
  • 5E Lee, H S Lee, Y Lee divisor over Computation hypereUiptic Eta pairing computation on general curves [ J ]. Journal of Symbolic ,2008,43(6) :452 - 474.
  • 6S Galbraith, K Harrison, D Soldera. Implementing the Tatepairing [ A ]. Algorithmic Number Theory Symtmsium ANTS[ C]. Berlin Heidelberg: Springer-Verlag, 2002. 324 - 337.
  • 7T Kobayashi, K Aoki, H Imai. Efficient algorithms for Tate pairing [J]. IEICE Trans Fundam,2006,89(01) : 134 - 143.
  • 8C A Zhao, F G Zhang, J W Huang. Efficient tate pairing com putation using double-base chains [ J] .Science in China Series F-Information Science,2008,51 (08) : 1096 - 1105.
  • 9A J Menezes, N Koblitz. Pairing-based cryptography at high security levels [ A ]. Cryptography and Coding E C ]. Berlin Heidelberg: Springer-Verlag, 2005.13 - 36.
  • 10R Granger, F Hess, R Oyono, N Theriault, F Vercauteren. Ate Pairing onHyperelliptic Curves [ A]. EUROCRYPF 2007[ C]. Berlin Heidelberg: Springer-Veflag, 2007.430 - 447.

共引文献6

同被引文献29

  • 1Joux A.The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems,2002.
  • 2Paulo S. L. M. Barreto,Steven D. Galbraith,Colm ó’ héigeartaigh,Michael Scott.Efficient pairing computation on supersingular Abelian varieties[J]. Designs, Codes and Cryptography . 2007 (3)
  • 3Antoine Joux.A One Round Protocol for Tripartite Diffie–Hellman[J]. Journal of Cryptology . 2004 (4)
  • 4Gerhard Frey,Hans-Georg Rück.A remark concerning $m$-divisibility and the discrete logarithm in the divisor class group of curves[J]. Mathematics of Computation . 1994 (206)
  • 5Hess, Florian,Smart, Nigel P.,Vercauteren, Frederik.The Eta pairing revisited. IEEE Transactions on Information Theory . 2006
  • 6Barreto P,Kim H,Lynn B,Scott M.Efficient algorithms for pairing-based cryptosystems. Advances in Cryptology-Proceedings of CRYPTO 2002 . 2002
  • 7Dan Boneh,Matthew Franklin.Identity-Based Encryption from the Weil Pairing. SIAM Journal on Computing . 2003
  • 8Boneh D,Shacham H.Group signatures with verifier-local revocation. ACM CCS 04 . 2004
  • 9Ar’’ene C,Lange T,Naehrig M,Ritzenthaler C.Faster Computation of Tate Pairings. Cryptology ePrint Archive,Report 2009/155,http://eprintiacr.org/2009/155.pdf .
  • 10Liangze Li,Fan Zhang.Tate Pairing Computation on Generalized HessianCurves. http://isaa.sch.ac.kr/wisa2012/Session202/5-109_Tate Pairing Computation on Generalized Hessian Curves.pdf .

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部