期刊文献+

用有效可计算自同态来计算Tate配对(英文)

A Note on Computing the Tate Pairing with Efficiently Computable Endomorphisms
下载PDF
导出
摘要 研究用某些有效可计算的自同态来加速椭圆曲线上的Tate配对计算。针对两类嵌入指数k为偶数的椭圆曲线,用自同态对Miller算法做改进。针对k=2的情形分析了改进算法的效率,并给出一些特定条件和实例,表明改进算法比传统的Miller算法在计算Tate配对时计算速度明显加快。 The authors examine faster computation of Tate pairing on elliptic curves by using some efficiently computable endomorphism.Focused on two typical types of elliptic curves with even embedding degree k,Miller algorithm with some endomorphisms is modified.The authors analyze the efficiency for k = 2,and give the certain conditions and several examples,under which the proposed method is specifically faster than the traditional one.
出处 《北京大学学报(自然科学版)》 EI CAS CSCD 北大核心 2010年第5期685-690,共6页 Acta Scientiarum Naturalium Universitatis Pekinensis
基金 国家自然科学基金(10990011,60763009) 国家建设高水平大学公派研究生项目(2009601236)资助
关键词 椭圆曲线 TATE配对 Miller算法 自同态 elliptic curve Tare pairing Miller algorithm endomorphism
  • 相关文献

参考文献28

  • 1Frey G, Rack H G. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math Comp, 1994, 62(206) : 865-874.
  • 2Miller V S. The Weil pairing, and its efficient calculation. Journal of Cryptology, 2004, 17 (4) : 235- 261.
  • 3Barreto P S L M, Galbraith S D, OhEigeartaigh C, et al. Efficient pairing computation on supersingular abelian varieties. Des Codes Cryptogr, 2007, 42 (3): 239-271.
  • 4Hess F. Pairing lattices//Galbraith S D, Paterson K G. Pairing 2008: LNCS 5209. Heidelberg: Springer. 2008 : 18-38.
  • 5Hess F, Smart N P, Yercauteren F. The Eta pairing revisited. IEEE Trans Inform Theory, 2006, 52( 10): 4595-4602.
  • 6Lee E, Lee H S, Park C M. Efficient and generalized pairing computation on Abelian varieties. IEEE Trans Inform Theory, 2009, 55(4) : 1793-1803.
  • 7Vercauteren F. Optimal pairings. IEEE Trans Inform Theory, 2010, 56(1): 455-461.
  • 8Zhao C, Zhang F. Computing the bilinear pairings on elliptic curves with automorphisms[ EB/OL]. (2008-05- 12) [2010-04-09 ]. http : //eprint. iacr. org/2008/209.
  • 9Barreto P S L M, Kim H Y, Lynn B, et al. Efficient algorithms for pairing-based cryptosystems // Yung M CRYPTO 2002. Heidelberg: Springer, 2002:354-368.
  • 10Barreto P S L M, Lynn B, Scott M. On the selection of pairing-friendly groups//Matsui M, Zuccherato R. SAC 2003. Heidelberg: Springer, 2004:17-25.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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