摘要
提出了一种新的快速ＲＳＡ算法。这种算法利用平方剩余和乘同余的对称特性，使ＲＳＡ算法的求模运算量平均减少了约３０％，并通过降低乘数和被乘数的绝对值缩短了乘法时间，从而提高了整个ＲＳＡ算法的速度。
A new fast RSA algorithm is presented in this popor. The algorithin not only decreases themodulo oporation by about thirty poreent using symmetry of moduto multiplication, but cuts themultiplcation tune down through lowenng the athelute vaiue of multiplication factor ,bence speeds up the ofwhole RSA algorithm. The new fast algorithm can be comtaned with some fast RSA algorithms else , forexaniple ,recureive suirs of residues ete.,to form combined alsorithms. It is of great significance.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
1995年第S2期223-228,共6页
Journal of University of Electronic Science and Technology of China
基金
电子部青年基金
关键词
公钥密码
体制
RSA
幂剩余
快速算法
public key
cryptcoystem
RSA
modulo exponentiation
fast algorithm
