一种新的组合快速RSA算法  

A new combined fast RSA algorithm

作　　者：王宇洁[1] 张晓丹[1] 许占文[1] 郑守春[1] 

机构地区：[1]沈阳工业大学信息科学与工程学院,辽宁沈阳110023

出　　处：《沈阳工业大学学报》2001年第3期224-227,共4页Journal of Shenyang University of Technology

摘　　要：简述了基于乘同余对称特性的快速 RSA算法（ SMM）及其改进算法、递 归余数和快速算法（ RSR），并进行了简要的分析 .在两种快速算法的基础上又提出了一种 新的组合 RSA算法 .定性分析表明，新算法比上述两种算法速度更快 .A new fast algorithm is presented in this paper,which is the combi nation of two fast RSA algorithms.One is based on the improved algorithm of symm etry of modulo multiplication(SMM),another is based on recursive sums of residue s(RSR).The qualitative analysis expressed that the new algorithm is superior to and faster than either SMM or RSR,or conventional binary representation(BR)algor ithm.This is of great significance for applications of public－ key cryptosystem based on RSA.

关 键 词：公钥密码体制 递归余数和 幂剩余 快速算法 SMM 

分 类 号：TN918.1[电子电信—通信与信息系统] TP309.7[电子电信—信息与通信工程]