基于乘同余对称特性的快速RSA算法的改进 |
| |
引用本文: | 陈运.基于乘同余对称特性的快速RSA算法的改进[J].电子科技大学学报(自然科学版),1997,26(5):477-482. |
| |
作者姓名: | 陈运 |
| |
作者单位: | 1.电子科技大学电子技术系 成都 610054 |
| |
摘 要: | 提出了一种新的快速RSA算法,这种算法是基于乘同余对称特性的快速RSA算法(SMM算法)的改进。理论分析表明,新算法的迭代计算步数平均减少了17.2%。与传统的二进制算法(BR算法)相比,新算法的计算速度平均提高了42%左右。
|
关 键 词: | 密码学 公钥密码体制 RSA 幂剩余 快速算法 |
收稿时间: | 1996-11-06 |
An Improved Algorithm for RSA Based on Symmetry of Modulo Multiplication |
| |
Affiliation: | 1.Dept. of Electronic Tech.,UEST of China Chengdu 610054 |
| |
Abstract: | A new fast RSA algorithm is presented in this paper,which is an improvement of a fast RSA algorithm based on symmetry of modulo multiplication (SMM algorithm).It is shown by theoretical analysis that the proposed algorithm decreases the recursive steps by 17.2% on average.Compared with troditional binary representations (BR algorithm),the new algorithm obtains the speed improvement by about 42% on average. |
| |
Keywords: | |
本文献已被 维普 等数据库收录! |
| 点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《电子科技大学学报(自然科学版)》下载全文 |