RSA加密方式中Montgomery算法的研究与改进  

The resaearch and improvement of Montgomery algorithm in the application of RSA encryption method

作　　者：肜丽[1] 姜明富[1] 

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

出　　处：《信阳农业高等专科学校学报》2013年第4期107-109,共3页Journal of Xinyang Agricultural College

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

摘　　要：运算安全和运算效率问题是目前RSA加密体制的关键问题。实际应用中RSA密码算法加密、解密运算均为模幂运算,即Memod N。将模幂运算转换为一系列模乘运算便于硬件实现,并且可以进行并行运行,提高运算效率。本文主要通过对Montgomery算法进行研究,然后提出改进的高基Montgomery算法来提高RSA密码算法的运算速度和执行效率。Operation safety and operation efficiency problem are one of the key problems of RSA encryption system. RSA algorithm encryption and decryption operation are modular exponentiation in the practical application, that is M3 rood N. Modulo expenentiation can be converted to a series of modular multiplicationis, which is easy to be realized by hardware, and can be run in parallel in order to improve operational efficiency. This paper mainly studies the Montgomery algo- rithm, and then puts forward high based improved Montgomery algorithm to improve the speed and efficiency of RSA algo- rithm

关 键 词：基2-Montgomery算法 基8-Montgomery算法 模乘运算 模幂运算 

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