期刊文献+

对称三进制在椭圆曲线标量乘法中的应用 被引量:2

Application of Balanced Ternary in Elliptic Curve Scalar Multiplication
在线阅读 下载PDF
导出
摘要 把对称三进制引入到椭圆曲线密码体制标量乘法中,对k进行重新编码,直接计算kP,以改进标量乘法的运算效率。给出将k重新编码为对称三进制串的算法,提出对称三进制标量乘法算法。相对于二进制标量乘法算法,平均效率提升5.4%。当进行预计算时,相对于二进制算法和二进制预计算算法,平均效率分别提升73.18%、15.58%,并且能减少需要存储的点数。 Recoding k and direct computing kp by introducing the balanced ternary to scalar multiplication can improve its efficiency.This paper gives an algorithm which recodes k as balanced ternary string,and proposes a balanced ternary algorithm to scalar multiplication.In this case,the average efficiency is improved 5.4% relative to the binary algorithm.When precomputation is used,the average efficiency is improved 73.18% and 15.58% relative to the algorithm which uses binary and binary precomputation,and the accounts which need to store is declined observably.
出处 《计算机工程》 CAS CSCD 2012年第5期152-154,共3页 Computer Engineering
关键词 椭圆曲线密码体制 标量乘法 对称三进制算法 二进制算法 预计算 Elliptic Curve Cryptography(ECC) scalar multiplication balanced ternary algorithm binary algorithm precomputation
  • 相关文献

参考文献8

  • 1陈辉,鲍皖苏.基于半点运算与多基表示的椭圆曲线标量乘法[J].计算机工程,2008,34(15):153-155. 被引量:8
  • 2Essame A D,Ramlan M,Mohammad R,et al.A New Addition Formula for Elliptic Curves over GF(2∧n)[J].IEEE Trans.on Computers,2002,51(8):972-975.
  • 3Lim C H,Lee P.More Flexible Exponentiation with Precompu-tation[C] //Proc.of the 14th Annual International Cryptology Conference on Cryptology.Berlin,Germany:Springer-Verlag,1994:95-107.
  • 4Elsentrager K,Lauter K,Montgomery P L.Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation[C] //Proc.of Cryptographers’Track at RSA Conference.[S.l.] :Springer-Verlag,2003:343-354.
  • 5Ciet M,Joye M,Lauter K,et al.Trading Inversions for Multi-plications in Elliptic Curve Cryptography[EB/OL].(2003-04-16).http://eprint.iacr.org/2003/257.
  • 6陈其翔.ī0 1三进位制与对称三值逻辑[EB/OL].(2009-11-25).http://www.sciencenet.cn/upload/blog/file/2009/11/2009111012486739596.pdf.
  • 7Hankerson D,Menezes A J,Vanstone S.Guide to Elliptic Curve Cryptography[M].[S.1.] :Springer-Verlag,2004.
  • 8刘连浩,申勇.椭圆曲线密码体制中标量乘法的快速算法[J].计算机应用研究,2009,26(3):1104-1108. 被引量:12

二级参考文献7

  • 1Dimitrov 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.
  • 2Mishra 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.
  • 3Knudsen E W. Elliptic Scalar Multiplication Using Point Halving[C]//Proc. of ASIACRYPT'99. [S. l.]: Springer-Verlag, 1999: 135-149.
  • 4Wong 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.
  • 5Fong K, Hankerson D, Lopez J, et al. Field Inversion and Point Halving Revisited[J]. IEEE Transactions on Computers, 2004, 53(8): 1047-1059.
  • 6Ciet M, Joye M, Lauter K, et al. Trading Inversions for Multiplications in Elliptic Curve Cryptography[Z]. (2003-02-01). http://eprint.iacr.org/2003/257.
  • 7Mathieu Ciet,Marc Joye,Kristin Lauter,Peter L. Montgomery. Trading Inversions for Multiplications in Elliptic Curve Cryptography[J] 2006,Designs, Codes and Cryptography(2):189~206

共引文献18

同被引文献11

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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