基于中国剩余定理的RSA系统中的出错攻击与防范  

Wrong attack and guard of RSA system based on Chinese remainder theorem

作　　者：孙秀娟[1] 金民锁[2] 

机构地区：[1]黑龙江科技学院数力系,哈尔滨150027 [2]黑龙江科技学院信息网络中心,哈尔滨150027

出　　处：《哈尔滨商业大学学报（自然科学版）》2009年第4期477-478,共2页Journal of Harbin University of Commerce：Natural Sciences Edition

基　　金：黑龙江科技学院青年教师基金资助项目(07-18)

摘　　要：RSA算法的最大缺点是计算量大,费时,从而降低了RSA的运行效率.而在模幂运算中运用中国剩余定理能有效地改进模幂运算的速度.但在出错的情况下RSA算法就会出现被攻击的可能.针对这种攻击提出了一些对抗的措施.在前人的基础上对这种攻击的防范作了近一步的改进.The RSA algorithm＇s biggest shortcoming is the computation load is big, time-consuming, thus cut the RSA operating efficiency. But can improve the mold power operation effectively in the mold power operation using the Chinese remainder theorem the speed. But the RSA algorithm will appear the possibility to be attacked under the condition of making a mistake. Proposes some resistance measure in view of this kind of attack on some people. This paper makes a nearly step improvement in predecessor＇s foundation to this kind of attack＇s guard.

关 键 词：RSA算法 中国剩余定理 模幂运算 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]