融入中国剩余定理及Montgomery算法的快速RSA算法研究  

Integration into the Chinese remainder theorem and Montgomery algorithm for fast RSA algorithm

作　　者：于丽丽[1] 王丽君[1] 

机构地区：[1]辽宁科技大学软件学院,辽宁鞍山114051

出　　处：《微型机与应用》2010年第6期67-70,74,共5页Microcomputer & Its Applications

摘　　要：利用中国剩余定理和Montgomery模乘算法的思想,改进了RSA密码体制。改进后的中国剩余定理算法在时间效率上有较大提高,而且加入Montgomery模乘算法使模乘速度及安全性都有较大的提高,更加适合于高速的RSA密码体制。Make use of the idea of Chinese remainder theorem and Montgomery modular multiplication algorithm to improved RSA cryptosystem： on the one hand, improved after the Chinese remainder theorem algorithm for time efficiency has improved great- ly, the speed increase is about 4 times more than before; the other hand, by joining the Montgomery modular multiplication algo- rithm for modular muhiplication so that we have had good speed and security improvements, and more suitable for high-speed RSA cryptosystem.

关 键 词：RSA密码体制 中国剩余定理 Montgomery模乘算法 

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