摘要
大数模幂在密码学领域有广泛的应用,它是公钥密码的基础。文章对目前比较典型的各种大数模幂算法的设计思想进行了深入剖析,从基本设计原理和实现角度对这些模幂算法进行了整理和分类,归纳给出了各种算法的优缺点、实现方法和使用环境。
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 exponentiatiorts 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.
出处
《计算机与数字工程》
2006年第6期16-19,共4页
Computer & Digital Engineering
基金
浙江省自然科学基金重点项目(编号:ZD0101)资助
关键词
大数模幂
二元算法
m-ary算法
滑动窗口算法
BGMW算法
指数重编码算法
Fast Modular Exponenfiation of Large Numbers, Binary Array Algorithm, M - ary Algorithm, Slide - Windows Algorithm, BGMW Algorithm, Exponentiation Reeoding Algorithm
