期刊文献+

基于模糊控制器的w2MOF快速标量乘算法 被引量:1

FAST W2MOF SCALAR MULTIPLICATION BASED ON FUZZY CONTROLLER
下载PDF
导出
摘要 椭圆曲线密码体制中基点的标量乘是最耗时的一种操作,通过预计算的方式可以有效地提高其效率。借助于更灵活且高效的2MOF表示形式,在此基础上利用滑动窗口技术,结合混合坐标下直接计算2^kQ+P的计算方式,对w2MOF算法进行改进。对于滑动窗口技术下最优窗口宽度的选择,采用预先设计好的模糊控制器做出决策。根据目前常用的两种模糊推理系统,模糊控制器选择了Mamdani模型。实验结果分析,结合模糊控制器与优化的w2MOF算法,平均效率大约提高11.7%,而且比基于wNAF算法的文献[1]中在曲线NIST-B163上,最优窗口w=5下减少了19次点加运算量。 Scalar multiplication of basis points in elliptic curve cryptosystems is one of the most time-consuming operations,but the efficiency can be improved by the way of pre-computation. By means of more flexible and efficient form of 2MOF representation,and using sliding window technology on this basis,we modified the w2MOF algorithm in combination with the computation mode of directly calculating2~kQ + P on mixed coordinates. For the selection of optimal window width using sliding window technology,we used the pre-designed fuzzy controller to make decision. According to commonly used two kinds of fuzzy inference system,the fuzzy controller chose Mamdani model.Analysis of experimental results showed that with the combination of fuzzy controller and optimised w2MOF algorithm,the average efficiency improved about 11. 7%,and compared with the wNAF algorithm-based literature[1 ],on elliptic curve NIST-B163 and under the optimal window w = 5,the amount of point adding operation reduced 19 times.
出处 《计算机应用与软件》 CSCD 2016年第4期325-328,共4页 Computer Applications and Software
关键词 椭圆曲线密码体制 w2MOF 混合坐标 滑动窗口 模糊控制器 Elliptic curve cryptosystem w2MOF Mixed coordinates Sliding window Fuzzy controller
  • 相关文献

参考文献11

  • 1Koblitz N.Elliptic curve cryptosystems[J].Mathematics of computation,1987,48(177):203-209.
  • 2Miller V S.Use of elliptic curves in cryptography[C]//Advances in Cryptology-CRYPTO’85 Proceedings.Springer Berlin Heidelberg,1986:417-426.
  • 3赖忠喜,张占军,陶东娅.椭圆曲线底层域快速算法的研究[J].计算机工程与应用,2014,50(3):67-70. 被引量:5
  • 4Okeya K,Schmidt-Samoa K,Spahn C,et al.Signed binary representations revisited[C]//Advances in Cryptology-CRYPTO 2004.Springer Berlin Heidelberg,2004:123-139.
  • 5Balasubramaniam P,Karthikeyan E.Elliptic curve scalar multiplication algorithm using complementary recoding[J].Applied mathematics and computation,2007,190(1):51-56.
  • 6Hankerson D,Vanstone S,Menezes A J.Guide to elliptic curve cryptography[M].Springer,2004.
  • 7Huang X,Sharma D.Fuzzy controlling window for elliptic curve cryptography in wireless networks[C]//Computer Sciences and Convergence Information Technology(ICCIT),2010 5th International Conference on.IEEE,2010:521-526.
  • 8Kodali R K,Budwal H S,Patel K,et al.Fuzzy controlled scalar multiplication for ECC[C]//TENCON Spring Conference,2013 IEEE.IEEE,2013:352-356.
  • 9李忠,彭代渊.基于滑动窗口技术的快速标量乘法[J].计算机科学,2012,39(B06):54-56. 被引量:7
  • 10周梦,周海波.椭圆曲线快速点乘算法优化[J].计算机应用研究,2012,29(8):3056-3058. 被引量:11

二级参考文献30

  • 1刘连浩,申勇.椭圆曲线密码体制中标量乘法的快速算法[J].计算机应用研究,2009,26(3):1104-1108. 被引量:12
  • 2Noroozi E, Kadivar J, Shafiee S H. Energy analysis for wireless sensor networks[C]//IEEE International Conference on Mechanical and Electronics Engineering (ICMEE 2010). IEEE, 2010(2) :382-386.
  • 3Longa P,Gebotys C. Setting speed records with the (fractional) multibase non-adjacent form method for efficient elliptic curve scalar multiplication[C]//Department of Electrical and Computer Engineering University of Waterloo, Canada, 2009.
  • 4Shah P G, Huang X, Sharma D. Algorithm Based on One's Complement for Fast Scalar Multiplication in ECC for Wireless Sensor Network[C]//IEEE 24th International Conference on Advanced Information Networking and Applications Workshops (WAINA). 2010 : 571-576.
  • 5Okeya K,Schmidt-Samoa K, Spahn C, et al. Signed Binary Representations Revisited[C]//Advances in Cryptology CRYPTO 2004(LNCS,3152). New York:Springer-Verlag, 2004:123-139.
  • 6Huang X, Shah P G, Sharma D. Minimizing Hamming Weight Based on l's Complement of Binary Numbers Over GF(2^m)[C]// The 12th International Conference on Advanced Communication Technology (ICACT). Gangwondo, Korea, Feb. 2010, 2: 1226- 1230.
  • 7Mahdavi R, Saiadian A. Efficient Scalar Multiplications for Ellip tic Curve Cryptosystems Using Mixed Coordinates Strategy and Direct Computations [C]//Cryptology and Network Security (LNCS6467). 2010:184-198.
  • 8Hankerson D, Menezes A, Vanstone S. Guide to elliptic curve cryptography[M]. Springer-Verlag Professional Computing Series, 2004.
  • 9Sakai Y, Sakurai K. Efficient Scalar Multiplications on Elliptic Curves with Direct Computations of Several Doublings[J]. IEICE Transaction on Fundamentals,2001 ,E84(A):120-129.
  • 10Okeya K, Schmidt-Samoa K, Spahn C, et al. Signed binary representations revisited[C]//Andanees in Cryptology- CRYPTO ' 04,LNCS 3152. 2004;123-139.

共引文献18

同被引文献8

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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