| 大数模幂乘动态匹配快速算法及其应用 |
| |
| 引用本文： | 丁宏,陈勤.大数模幂乘动态匹配快速算法及其应用[J].小型微型计算机系统,2002,23(11):1398-1400. |
| |
| 作者姓名： | 丁宏 陈勤 |
| |
| 作者单位： | 杭州电子工业学院,计算机科学与技术系,浙江,杭州,310012 |
| |
| 基金项目： | 浙江省自然科学基金重点项目(ZD0101)资助 |
| |
| 摘 要： | 针对 RSA、Elgamal、DSA等算法在进行数据加密或数字签名时都要进行复杂的大数模幂乘运算 ,本文分析了目前常用的几种大数模幂乘算法 ,并在此基础上提出了一种动态匹配快速算法 .实验表明 ,将该算法用于实现 RSA算法 ,其实现速度较其他算法有明显提高 .
|
| 关 键 词： | 数据加密 数字签名 公钥密码 模幂乘运算 动态匹配 |
| 文章编号： | 1000-1220(2002)11-1398-03 |
High Speed Algorithm for Implementatation Large Modular Exponen Tiation With Dynamic Matching and Its Applications |
| |
| DING Hong,CHEN Qin.High Speed Algorithm for Implementatation Large Modular Exponen Tiation With Dynamic Matching and Its Applications[J].Mini-micro Systems,2002,23(11):1398-1400. |
| |
| Authors: | DING Hong CHEN Qin |
| |
| Abstract: | Arming at the complicated large modular exponentiation of public-key cryptography and digital signature such as RSA, Elgamal and DSA, this paper has analyzed some algorithms for implementation large modular exponentiation. On this base, a high speed algorithm for implementation large modular exponentiation with dynamic matching is presented. The results of experiment show that the implementing speed of RSA with this algorithm is higher than other algorithms. |
| |
| Keywords: | data encipher digital signature public-key cryptography modular exponentiation dynamic matching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
