期刊文献+

多标量乘算法的快速实现

Fast Implementation of Multiple Scalar Multiplication
下载PDF
导出
摘要 标量乘及多标量乘算法是实现椭圆曲线密码系统的关键,如何快速高效实现标量乘及多标量乘算法是研究的重点。将基于滑动窗口的NAF算法引入到interleaving算法中,提出了基于滑动窗口NAF的interleaving算法,该算法在计算速度方面优于基本interleaving算法。 Scalar multiplication algorithm and multiple scalar multiplication algorithm are the key algorithms of elliptic curve cryptography.How to implement these algorithms is of great importance.A new interleaving multiple scalar multiplication algorithm based on the application of a sliding window scheme on non-adjacent form is presented.It is faster than basic interleaving method in computing performance.
出处 《河南科技大学学报(自然科学版)》 CAS 2005年第2期51-54,i004,共5页 Journal of Henan University of Science And Technology:Natural Science
基金 安徽省教育厅自然科学研究资助项目(2002KJ198) 安徽省教育厅自然科学研究资助项目(2005KJ365zc)
关键词 算法 标量 快速实现 椭圆曲线密码系统 滑动窗口 快速高效 计算速度 NAF Elliptic curve cryptography Multiple scalar multiplication Interleaving method Sliding window scheme on NAF
  • 相关文献

参考文献8

  • 1牛广平,马建峰.椭圆曲线标量乘的快速实现[J].计算机工程,2004,30(16):45-46. 被引量:7
  • 2Julio Lopez,Ricardo Dahab.An Overview of Elliptic Curve Cryptography[R].Brazil:Institute of Computing State University of Campinas,2000.
  • 3Darrel Hankerson,Julio Lopez Hernandez,Alfred Menezes.Software Implementation of Elliptic Curve Cryptography over Binary Fields[J].Lecture Notes in Compute Science Springer-Verlag,2000,1965:1-24.
  • 4Michael Brown,Darrel Hankerson,Julio Lopez,et al,Software Implementation of the NIST Elliptic Curves over Prime Fields [J].Lecture Notes in Computer Science Springer-Verlag,2001,2020:250-265.
  • 5Katja Schmidt-Samoa,Olivier Semay,Tsuyoshi Takagi.Analysis of Some Efficient Window Methods and their Application to Elliptic Curve Cryptosystems[EB/OL].http://www.informatik.tu-darmstadt.de/ftp/pub/TI/TR/TI-04-03.realfinal.ps.gz,2004-08-16.
  • 6Bodo Mller.Improved Techniques for Fast Exponentiation[J].Lecture Notes in Computer Science Springer-Verlag,2003,2587:298-312.
  • 7Bodo Mller.Algorithms for Multi-exponentiation[J].Lecture Notes in Computer Science Springer-Verlag,2001,2259:165-180.
  • 8Kunio Kobayashi,Hikaru Morita,Mitsuari Hakuta.Multiple Scalar-Multiplication Algorithm over Elliptic Curve[J].Ieice Trans.Inf.& Syst.,2001,E84-D-2:271-276.

二级参考文献5

  • 1Blake I F, Seroussi G,Smart N P.Elliptic Curves in Cryptography[M].Cambridge:Cambridge University Press, 1999
  • 2Brown M,Hankerson D,Lopez J,et al.Software Implementation of the NIST Elliptic Curves over Prime Fields[A]. Progress in CryptologyCT-RSA 2001, LNCS 2020[C], Springer-Verlag, 2001:250-265
  • 3Moller B.Algorithms for Multi-exponentiation[A].Selected Areas in Cryptography, LNCS 2259[C],Springer Verlag, 2001:165-180
  • 4Brickell E,Gor don D, McCurley K,et al. Fast Exponentiation with Precomputati on[A].Advances in Cryptology-Eurocrypt ′92,LNCS 658[C], Springer-Verlag, 1993:200-207
  • 5Lim C,Lee P.More Flexible Exponentiation with Precomputation[A].Advances in Cryptology-Crypto ′94, LNCS 839[C], Springer Verlag,1994:95-107

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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