Montgomery算法及其在加密硬件中的实现  

MONTGOMERY ALGORITHM AND ITS HARDWARE IMPLEMENTATION

作　　者：邓玉良[1] 毛志刚[1] 叶以正[1] 

机构地区：[1]哈尔滨工业大学微电子中心

出　　处：《计算机研究与发展》1999年第4期505-508,共4页Journal of Computer Research and Development

摘　　要：随着计算机及其网络在社会生活中应用不断扩大，信息安全成为信息领域重要的研究课题．文中在介绍ＲＳＡ算法实现数据加密的基础上，描述了用Ｍｏｎｔｇｏｍｅｒｙ算法实现ＲＳＡ数据加密及数字签名过程中取模乘法和取模幂乘的实现步骤，并且对Ｍｏｎｔｇｏｍｅｒｙ算法在硬件设计时的特性进行分析．设计结果表明，据此构造的ＲＳＡ加密处理器加密速度快，硬件开销小，具有实用价值．Information security has become a research focus as a result of the increasngly wide application of computers and their networks. After introducing the RSA algorithm with which data encryption is processed,the paper presents the steps for modular multiplication and modular exponentiation based on Montgomery algorithm during RSA encryption and digital signature construction, and gives analysis of the characteristics of Montgomery algorithm for hardware implementation. Design results show that this kind of cryptoprocessor is more practical for it has faster encryption rate, and less die area.

关 键 词：RSA算法 MONTGOMERY算法 加密硬件 信息安全 

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