摘要
提出了一种新的快速ＲＳＡ算法，这种算法是基于乘同余对称特性的快速ＲＳＡ算法（ＳＭＭ算法）的改进。理论分析表明，新算法的迭代计算步数平均减少了１７．２％。与传统的二进制算法（ＢＲ算法）相比，新算法的计算速度平均提高了４２％左右。
A new fast RSA algorithm is presented in this paper,which is an improvement of a fast RSA algorithm based on symmetry of modulo multiplication (SMM algorithm).It is shown by theoretical analysis that the proposed algorithm decreases the recursive steps by 17.2% on average.Compared with troditional binary representations (BR algorithm),the new algorithm obtains the speed improvement by about 42% on average.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
1997年第5期477-482,共6页
Journal of University of Electronic Science and Technology of China
基金
电子部预研基金
关键词
密码学
公钥密码体制
RSA
保密通信
cryptograph
public key cryptosystem
RSA
modulo multiplication
fast algorithm
