Montgomery算法的研究与实现  

Study and Realization of Montgomery Algorithm

作　　者：张宪[1] 王喜成[1] 

机构地区：[1]桂林电子工业学院,广西桂林541004

出　　处：《现代电子技术》2004年第8期85-86,共2页Modern Electronics Technique

基　　金：广西壮族自治区自然科学基金

摘　　要：分析了 Montgom ery算法 ,指出用改进的预计算 Montgom ery算法实现模幂运算的过程 ,分析并比较了两种实现模乘和模幂乘算法。并分别用 C+ + 和 Modelsim进行仿真 。Montgomery algorithm is core section in RSA cryptosystem In this paper,introduced two modified Montgomery algorithm In the two algorithms,the RL modular exponentiation is adapted to hardware implementation by using parallel computation The two algorithms was simulated by C ++ and modelsim, and proved speed improvement of hardware encrypt and decrypt using the RL method

关 键 词：MONTGOMERY算法 模幂乘运算 模乘 RSA 

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