RSA加密方式的应用及优化  

Application and Optimization of RSA Encryption

作　　者：姜明富[1] 栗磊[1] 

机构地区：[1]信阳农林学院计算机科学系,河南信阳464000

出　　处：《信阳农林学院学报》2014年第4期121-124,共4页Journal of Xinyang Agriculture and Forestry University

基　　金：河南省基础与前沿技术研究计划项目(132300410452);信阳农林学院青年科研基金项目(201301006)

摘　　要：本文研究了RSA密码体制的核心算法,提出了该核心算法在处理大数运算时速度太慢的问题。RSA加密体制执行的效率很大程度取决于快速进行模幂运算,模幂运算又相当于模乘运算的循环,蒙哥马利模乘运算利用二进制数的位移原理解决了快速模乘问题。根据蒙哥马利模乘运算的原理,验证了蒙哥马利算法提高RSA加密体制的实际效率。This paper studies the core algorithm of RSA cipher system, and analyzes the speed of core algorithm in dealing with prob- lems of large number operation is too slow. RSA encryption system execution efficiency depends on fast modular exponentiation to a great extent, and modular exponentiation is equivalent to the cycle of modular multiplication. Montgomery modular multiplication using a binary number solved the problem of fast modular multiplication. According to the principle of Montgomery modular multiplication, we verify that the Montgomerie algorithm can improve the practical efficiency of RSA eneryption system.

关 键 词：RSA加密体制 蒙哥马利算法 快速模乘 

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