期刊文献+

基于折半运算的带符号阶乘展开式标量乘算法 被引量:1

The Scalar Multiplication Algorithm of Signed Factorial Expansion Based on Point Halving
下载PDF
导出
摘要 阶乘展开表示形式标量乘算法是椭圆曲线密码的一种快速标量乘算法。为能进一步有效提升阶乘展开表示形式的标量乘算法的计算效率,且因折半运算比倍点运算的执行效率更加高效,通过把折半运算的方法应用在带符号的阶乘展开表示形式的标量乘算法中,在预计算和主循环计算阶段分别用折半运算替代倍点运算,提出了一种基于折半运算的带符号阶乘展开式标量乘算法。算法的性能分析结果表明:与传统的阶乘展开表示形式标量乘算法相比,新算法的运算效率提高了约60.78%。 The scalar multiplication algorithm of factorial expansion representation is a fast scalar multiplication algorithm in elliptic curve cryptography. Due to that point halving has higher execution efficiency than double operations, point halving is applied in the signed factorial expansion scalar multiplication algorithm in order to further improve the factorial expansion scalar multiplication algorithms, and then a signed factorial expansion scalar multiplication based on point halving is proposed in which the double operation is replaced by the point halving in the stage of pre-computation and the main loop. The performance analysis results show that the new algorithm could improve the efficiency by 60.78 % compared with the traditional factorial expansion scalar multiplication algorithm.
作者 庞根明
出处 《控制工程》 CSCD 北大核心 2018年第3期504-508,共5页 Control Engineering of China
基金 国家自然科学基金资助项目(51308126)
关键词 圆曲线密码 标量乘法 带符号阶乘展开式算法 折半运算 Ellipse curve cryptography scalar multiplication signed factorial expansion algorithm point halving
  • 相关文献

参考文献4

二级参考文献15

  • 1Tzer-ShyongChen,Kuo-HsuanHuang,Yu-FangChung.Digital Multi-Signature Scheme Based on the Elliptic Curve Cryptosystem[J].Journal of Computer Science & Technology,2004,19(4):570-572. 被引量:11
  • 2石润华,钟诚.一种快速的椭圆曲线标量乘方法[J].计算机工程与应用,2006,42(2):156-158. 被引量:9
  • 3张亚娟,祝跃飞,况百杰.整数对的低重量表示JSF_3(英文)[J].软件学报,2006,17(9):2004-2012. 被引量:4
  • 4刘淳,张凤元,张其善.基于智能卡的素数域椭圆曲线密码的快速实现[J].计算机工程与应用,2006,42(27):137-139. 被引量:4
  • 5DIMITROV V S, JULLIEN G A, MILLER W C. Theory and appli- cations for a double-base number system[ J]. IEEE Transactions on Computers, 1999, 48(10) : 1098 - 1106.
  • 6Dimitrov V S, Imbert L, Mishra P K. Fast Elliptic Curve Point Multiplication Using Double-base Chain[Z]. (2005-06-05). http:// eprint .iacr.org/2005/069.
  • 7Mishra P K, Dimitrov V. Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation[Z]. (2007-04-01 ). http://eprint.iacr.org/2007/040.
  • 8Knudsen E W. Elliptic Scalar Multiplication Using Point Halving[C]//Proc. of ASIACRYPT'99. [S. l.]: Springer-Verlag, 1999: 135-149.
  • 9Wong K W, Lee E C W. Fast Elliptic Scalar Multiplication Using New Double-base Chain and Point Halving[Z]. (2006-12-01). http://eprint .iacr.org/2006/124.
  • 10Fong K, Hankerson D, Lopez J, et al. Field Inversion and Point Halving Revisited[J]. IEEE Transactions on Computers, 2004, 53(8): 1047-1059.

共引文献31

同被引文献14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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