大数模乘算法的分析与研究  

Analyzing and Researching Modular Multiplication Algorithms of Larg er-Number

作　　者：王金荣[1] 陈勤[2] 丁宏[2] 

机构地区：[1]杭州师范学院信息工程学院,杭州310036 [2]杭州电子工业学院,杭州310037

出　　处：《计算机工程与应用》2004年第24期70-72,90,共4页Computer Engineering and Applications

基　　金：浙江省自然科学基金重点项目(编号:ZD0101);浙江省教育厅高校科研计划项目(编号:20030636)

摘　　要：大数模乘在密码学领域有广泛的应用,它是RSA、ElGamal等公钥密码的基本运算。文章对目前具有典型代表性的各种大数模乘算法的设计思想进行了深入剖析,从基本设计原理和实现角度对这些模乘算法进行整理和分类,归纳并给出了各类算法的优缺点、实现方法、适用环境和研究现状。Modular multiplication of larger-number has universal application in cryptography,and it is the base opera-tion in most public-key cryptography algorithms such as RSA,ElGamal.All typical modular multiplication algorithms have been analyzed deeply,and classed into three kinds according to their basic design principle and implementation.Finally,the merits and shortcomings,implementation methods,applicable condition and recent results of them have been conclud-ed.

关 键 词：RSA EIGAMAL Barrett算法 Quisquater算法 MONTGOMERY算法 

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