基于并元群的椭圆曲线密码点乘窗口算法的设计  

The Design of Windowing Algorithm for Scalar Multiplication of the Elliptic Curve Cryptography Based on the Dyadic Groups

作　　者：陆正福[1] 王国栋[1] 

机构地区：[1]云南大学数学与统计学院,云南昆明650091

出　　处：《昆明师范高等专科学校学报》2007年第4期91-93,共3页Journal of Kunming Teachers College

基　　金：国家自然科学基金资助项目(10561009);云南大学中青年骨干教师培养计划专项经费资助项目

摘　　要：在分析椭圆曲线公钥密码体制中点乘的传统窗口算法(TWA)基础上,运用并元点群的正则分解的方法,形成了一种新的优化算法:并元窗口算法(DWA).DWA的特点是空间上优于TWA,并以TWA为其特殊情形.此外,还给出了DWA程序实现.Based on the analysis of the traditional windowing algorithm（TWA） for the scalar point multiplication of the Elliptic Curve Cryptography, and by means of regular partition of the dyadic additive group, a new optimized algorithm, i.e. dyadic windowing algorithm （DWA）, is presented. The characteristics of the DWA is having lower space complexity than the TWA, furthermore, having the TWA as its special case. Moreover, program implementa- tion of the DWA is provided.

关 键 词：椭圆曲线密码体制 点乘 并元点群 陪集划分 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP309[自动化与计算机技术—计算机科学与技术]