摘要
大数模幂乘是 RSA、El Gamal、DSA等公钥密码算法和数字签名算法的基本运算 ,而大数模乘运算是快速实现模幂乘的关键 .本文在分析比较现有快速模乘算法的基础上 ,提出了一个基于滑动窗口的快速模乘算法 .由分析可知 ,当模 N的长度为 5 12位时 ,本算法平均只需做 5 0 7次 n- bit加法便可实现 A× B mod N运算 .
The large number modular multiplication is a key to fast implement the large number modular exponentiation which is the essential calculation of some public key cryptography and digital signature schemes such as RSA, ElGamal and DSA. In this paper, based on the analyzing and comparing some modular multiplication algorithms, we present a new modular multiplication algorithm on sliding window. According to our analysis, our new algorithm requires 506 additions on the average to calculate A×B mod N when modulo N 's length is 512 bits. The new algorithm is easy to implement by software and hardware.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第7期1367-1370,共4页
Journal of Chinese Computer Systems
基金
浙江省自然科学基金重点项目 ( ZD0 0 1)
关键词
模乘
模幂乘
算法
滑动窗口
公钥密码
modular multiplication
modular exponentiation
algorithm
sliding window
public key cryptography
