期刊文献+

R-ate配对的F_(q^m)域扩展

R-ate Extended to F_(q^m)
下载PDF
导出
摘要 为解决R-ate对实现中的不完全约减问题,提高计算效率,该文提出一种方法m-R-ate,将R-ate对的实现由Fq扩展至Fqm域中。此外,通过用特征q代替qm的方法对R-ate的公式进行化简,可大大提高R-ate算法效率。实验表明,消除整数不完全约减问题可至少提高7.8%的效率,粒度更细的(A,B)选择方式可有效的减少Miller循环次数,效率高于Atei算法。 In order to solve the troubles of incomplete reduction tumbled in the realization of R-ate and efficient compute the R-ate,a new technique named m-R-ate,which extend R-ate from Fq to Fq m,is proposed.Furthermore,in m-R-ate a very efficient algorithm of R-ate is obtained by replacing qm with the field character q in the formula.That overcoming incomplete reduction will improve the efficiency of R-ate 7.8% at least,and the Miller loop will be reduced by selecting of smaller granularity of(A,B),which is much better than Atei.
出处 《电子与信息学报》 EI CSCD 北大核心 2009年第11期2713-2715,共3页 Journal of Electronics & Information Technology
基金 博士后基金(57145) 国家自然科学基金(90604009)资助课题
关键词 密码学 双线性配对 TATE配对 Miller算法 Cryptography Bilinear pairing Tate pairing Miller algorithm
  • 相关文献

参考文献12

  • 1Boneh D and Franklin M. Identity-based encryption from Weil pairing[C]. Advances in Cryptology-CRYPTO 1998, http://eprint.iacr.org/.
  • 2Brezing F and Weng A. Elliptic curves suitable for pairing based cryptography[J]. Designs, Codes and Cryptography, http://eprint.iacr.org/2003/143/.
  • 3Galbraith S D, Harrison K, and Soldera D. Implementing the Tare pairing[C]. Algorithmic Number Theory Symposium - ANTS-V, 2002, LNCS, Vol. 2369: 324-337.
  • 4Miller V, Short programs for functions on curves, Unpublished Manuscript, 1986. http://crypto.stanford.edu /miller/miller.pdf.
  • 5Barreto P S L M, Kim H Y, Lynn B, and Scott M. Effcient algorithms for pairing-based cryptosystems[C]. Advances in Cryptology-CRYPTO 2002, 2002, LNCS, Vol 2442: 354-368.
  • 6Barreto P S L M, Calbraith S, and Scott M. Effcient pairing computation on supersingular abelian varieties[J]. Design, Codes and Cryptography, 2007, 42(3): 239-271.
  • 7Hess F, Smart N P, and Vercauteren F. The Eta pairing revisited[J]. IEEE Transactions on Information Theory, 2006, 52(2): 4595-4602.
  • 8Cranger R, Hess F, Oyono R, Theriault N, and Vercauteren F. Ate pairing on hyperelliptic curves[C]. Advances in Cryptology-EuroCrypt 2007, 2007, LNCS4515: 430-447.
  • 9Zhao C, Zhang F, and Huang J. A note on the ate pairing[C]. Preprint.2007. Available at http://eprint.iacr.org/2007/247.
  • 10Lee E, Lee H-S, and Park C M. Efficient and generalized paring computation on abelian varieties[C]. Preprint, 2008. Available at http://eprint.iacr.org/2008/040.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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