| 大数快速模幂算法的研究 |
| |
| 引用本文： | 陈艳波,唐四云,王学理.大数快速模幂算法的研究[J].科学技术与工程,2006,6(5):625-627. |
| |
| 作者姓名： | 陈艳波 唐四云 王学理 |
| |
| 作者单位： | 湖南大学数学与计量经济学院,长沙,410082 |
| |
| 摘 要： | 大数模幂在现代密码学领域有着广泛的应用，它是RSA．ELGamal等公钥密码的基本运算。对目前具有典型代表的各种大数模幂算法进行分析，从基本设计原理和实现角度对这些模幂算法进行分类，归纳并给出了各类算法的实现方法、优缺点和研究现状。
|
| 关 键 词： | 模幂 二进制法 2^k-ary法 滑动窗口法 |
| 文章编号： | 1671-1815(2006)5-0625-03 |
| 收稿时间： | 2005-10-31 |
| 修稿时间： | 2005年10月31 |
Researching Fast Modular Exponential Algorithms |
| |
| CHEN Yanbo,TANG Siyun,WANG Xueli.Researching Fast Modular Exponential Algorithms[J].Science Technology and Engineering,2006,6(5):625-627. |
| |
| Authors: | CHEN Yanbo TANG Siyun WANG Xueli |
| |
| Abstract: | Modular exponential of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms such as RSA, ELGamal. All typical modular exponential 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 are concluded. |
| |
| Keywords: | modular exponential binary algorithm 2^k-ary algorithm sliding-window algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
|
