首页 | 本学科首页   官方微博 | 高级检索  
     

探测窗口的NAF_ω算法
引用本文:蒋洪波,冯新宇,栾兵,沈显庆.探测窗口的NAF_ω算法[J].电子设计工程,2012,20(8):95-97.
作者姓名:蒋洪波  冯新宇  栾兵  沈显庆
作者单位:1. 黑龙江科技学院,黑龙江哈尔滨,150027
2. 东北农业大学成栋学院,黑龙江哈尔滨,150025
摘    要:椭圆曲线上的点乘运算是椭圆曲线加密(ECC)的一个关键运算,它的速度直接影响椭圆曲线加密的速度。本文分析了窗口宽度w的非相邻表示型(NAFω)算法,根据NAF的性质提出了一个探测窗口的NAFω算法。本算法减少了运算中的移位和异或运算次数,缩短了运算时间。经建模仿真,结果表明本算法的时间消耗大约是原算法的1/(ω+1)倍,且随ω的增大运算效率也在提高。

关 键 词:椭圆曲线  点乘  非相邻表示型  探测窗口

A NAFω algorithm for detection window
JIANG Hong-bo,FENG Xin-yu,LUAN Bing,SHEN Xian-qing.A NAFω algorithm for detection window[J].Electronic Design Engineering,2012,20(8):95-97.
Authors:JIANG Hong-bo  FENG Xin-yu  LUAN Bing  SHEN Xian-qing
Affiliation:1(1.Heilongjiang Institute of Science and Technology,Harbin 150027,China; 2.Chengdong College of Northeast Agricultural University,Harbin 150025,China)
Abstract:The point multiplication on elliptic curves is a key operation for Elliptic Curve Cryptography.Its speed affect the speed of ECC directly.The width w of the non-adjacent form(NAF) algorithm is analyzed and a NAFω algorithm for detection window is proposed by the character of NAF in this article.This algorithm reduces the number of times for the shift operations and XOR to shorten the computing time.The modeling and simulation results show that the time consumption of detection window method is about times for the original algorithm and the computational efficiency is also improving with ω increase.
Keywords:elliptic curve  point multiplication  non-adjacent form  detection window
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号