公钥密码中大数模幂的并行窗口算法  

A Parallel Window Algorithm for Large Integer Modular Exponentia tion

作　　者：殷新春[1] 张宝华[1] 

机构地区：[1]扬州大学计算机科学系,扬州225009

出　　处：《计算机工程与应用》2004年第18期50-53,共4页Computer Engineering and Applications

基　　金：国家863高科技研究发展计划资助项目(编号:2001AA144010);江苏省"333工程"资助项目(编号:20018)

摘　　要：模乘幂运算是公钥密码体制中最常用的基本运算,提高其运算速度可有效地提高公钥密码算法的加解密效率。该文给出一种大数模乘幂的并行窗口算法,并对在曙光-2000上进行实验所得的数据进行了分析,结果表明算法是有效的。A modular exponentiation for very large integers is one of the most common fundamental operations in many public-key cryptosystems.Speeding up the exponentiation can greatly improve the efficiency of the encryption and de-cryption of public-key algorithms.In this paper,we have proposed a parallel window algorithm for large integer modular exponentiation and have analyzed the results of the experiment done on Dawn-2000,it is shown that the parallel algo-rithm is very efficient.

关 键 词：公钥密码体制 模乘幂运算 平方-乘算法 窗口算法 并行 

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