关于Montgomery模乘迭代的可控性分析  

Analysis on Iterative Structure Controllability of Montgomery Modular Multiplication

作　　者：王金波[1] 

机构地区：[1]成都卫士通信息产业股份有限公司,四川成都610041

出　　处：《信息安全与通信保密》2007年第8期44-47,50,共5页Information Security and Communications Privacy

摘　　要：在公钥密码实现中,Montgomery模乘扮演着非常重要的角色。本文研究Montgomery模乘(MMM)的迭代控制结构,给出了进行MMM迭代的输入边界控制条件,以及改进的MMM算法。这种扩展的迭代控制条件适合用于复杂求幂的迭代过程,在其边界控制下可直接进行一些加法、减法及乘法等基本运算,而无须模约化处理。给出的模乘迭代算法具有高度的灵活性,可利用来实现安全高效的RSA、ECC等公钥密码体制。Montgomery modular multiplication（MMM） plays a crucial role in the implementation of modular exponentiations of public-key cryptography. In this paper, the iterative structure of MMM is discussed and the bound control condition extended. It can be applied to complicated modular exponentiations. Based on the bound control condition of MMM iteration, one can directly use non-modular additions, subtractions and even simple multiplications instead of the modular forms, which make modular exponentiationoperation more efficient and MMM iteration more applicable. As a result, an efficient and secure Nodular Montgomery Multiplier can be achieved to implement such public-key cryptosystems as RSA, ECC, etc.

关 键 词：公钥密码实现 MONTGOMERY模乘 求幂 迭代控制 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]