| 大数模幂算法的分析与研究 |
| |
| 引用本文： | 张海平.大数模幂算法的分析与研究[J].计算机与数字工程,2006,34(6):16-19. |
| |
| 作者姓名： | 张海平 |
| |
| 作者单位： | 杭州电子科技大学计算机学院,杭州,310018 |
| |
| 摘 要： | 大数模幂在密码学领域有广泛的应用，它是公钥密码的基础。文章对目前比较典型的各种大数模幂算法的设计思想进行了深入剖析，从基本设计原理和实现角度对这些模幂算法进行了整理和分类，归纳给出了各种算法的优缺点、实现方法和使用环境。
|
| 关 键 词： | 大数模幂 二元算法 m-ary算法 滑动窗口算法 BGMW算法 指数重编码算法 |
| 修稿时间： | 2005年8月26日 |
Researching on Fast Modular Exponentiation of Larger- number with Large Exponents |
| |
| Zhang Haiping.Researching on Fast Modular Exponentiation of Larger- number with Large Exponents[J].Computer and Digital Engineering,2006,34(6):16-19. |
| |
| Authors: | Zhang Haiping |
| |
| Abstract: | Modular exponentiation of larger-number has universal application in cryptography,and it is the base operation in most public-key cryptography algorithms.All typical modular exponentiations have been analyzed deeply and classed into several kinds according to their basic design principles and implementation.Finally, the merits and shortcomings implementation methods,applicable conditions are concluded. |
| |
| Keywords: | Fast Modular Exponentiation of Large Numbers Binary Array Algorithm M-ary Algorithm Slide-Windows Algorithm BGMW Algorithm Exponentiation Recoding Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
