| 引用本文: | 倪谷炎.分块模幂算法.[J].国防科技大学学报,2002,24(5):53-56.[点击复制] |
| NI Guyan.A Powering Algorithm Based on Disparting Blocks[J].Journal of National University of Defense Technology,2002,24(5):53-56[点击复制] |
|
| |
|
|
| 本文已被：浏览 6413次 下载 6251次 |
| 分块模幂算法 |
| 倪谷炎 |
|
(国防科技大学 理学院，湖南 长沙 410073)
|
| 摘要: |
| RSA是目前最成熟的一种公钥密码体系，RSA加解密算法的速度依赖于模幂算法，因而快速模幂算法一直是人们感兴趣的课题。该文提出了一种基于分块的模幂算法，对算法复杂性进行了讨论，并与其他模幂算法作了比较，从理论上论证了它具有更快的模幂速度。 |
| 关键词: 信息安全 密码学 RSA 模幂算法 |
| DOI： |
| 投稿日期：2002-04-02 |
| 基金项目: |
|
| A Powering Algorithm Based on Disparting Blocks |
| NI Guyan |
|
(College of Science, National Univ. of Defense Technology, Changsha 410073, China)
|
| Abstract: |
| RSA cryptosystem is the best one of the public key cryptosystems, and its enciphering or deciphering speed depends on a powering algorithm. This paper proposes a powering algorithm based on disparting blocks. By analyzing its complexity and comparing the complexity with other powering algorithms, it is proved that this is the fastest powering algorithm in Z/nZ. |
| Keywords: information security cryptography RSA powering algorithm |
|
|
