| 一种新的多机协同加密方案 |
| |
| 引用本文： | 陈勤,汪旦华. 一种新的多机协同加密方案[J]. 计算机工程, 2005, 31(18): 158-159 |
| |
| 作者姓名： | 陈勤 汪旦华 |
| |
| 作者单位： | 杭州电子工业学院软件分院,杭州,310037;杭州电子工业学院软件分院,杭州,310037;杭州师范学院医学院,杭州,310012 |
| |
| 基金项目： | 浙江省自然科学基金重点资助项目（ZD0101）;国防科技重点实验室基金资助项目;浙江省教育厅高校科研计划项目（20030636） |
| |
| 摘 要： | 提出了一种新的多机协同实现机制,结合RSA详细论述了多机协同机制的设计思想和实现方法,并进行了实现效率和安全性分析,结果表明,模数和指数都为1024比特时,新机制实现效率是单机模式的4倍,模数和指数都为2048比特时实现效率可提高8倍.
|
| 关 键 词： | 公钥密码 RSA 模幂运算 加密 多机协同计算 |
| 文章编号： | 1000-3428（2005）18-0158-02 |
| 收稿时间： | 2004-08-11 |
| 修稿时间： | 2004-08-11 |
A New Encryption Scheme with Multi-computer-cooperating |
| |
| CHEN Qing,WANG Danhua. A New Encryption Scheme with Multi-computer-cooperating[J]. Computer Engineering, 2005, 31(18): 158-159 |
| |
| Authors: | CHEN Qing WANG Danhua |
| |
| Affiliation: | 1. Software School,Hangzhou Institute of Electronic Engineering, Hangzhou 310037; 2. Medical School, Hangzhou Teacher College, Hangzhou 310012 |
| |
| Abstract: | A new mechanism for the realization with multi-computer in cooperating way is put forward in this paper. It elaborates the idea of the design and the implement method combining with the RSA. It analyzes the implement efficiency and the security. It turns out that the implement efficiency of the new mechanism is four times than the uni-computer model with 1024-bit modulus N and 1024-bit exponential d, and is eight times with 2048-bit N and 2048-bit d. |
| |
| Keywords: | Public key RSA Modular-exponentiation operation Encryption Multi-computer-cooperating computation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
