摘要
针对模幂型公钥密码的快速实现问题提出了一种新的多机协同实现机制,结合RSA详细论述了多机协同机制的设计思想和实现方法,并针对新机制设计了一种多机模幂算法,分别从工作机制和算法上进行了实现效率和安全性分析。结果表明,模数和指数都为1 024bit时,新机制实现效率是单机模式的8倍,模数和指数都为2 048bit时实现效率可提高16倍。
For the hight-speed implementation of the modular-exponentiation public key, a new mechanism for the realization with multi-computer in cooperating way is put forward, the idea of the design and the implement method combining with the RSA is elaborated, and a muti-computer modular-exponentiation arithmetic aiming at the new mechanism is devised, and the implementation efficiency and the security from the mechanism and the arithmetic are analyzed. It turns out that the implementation efficiency of the new mechanism is the eight times than the uni-computer model with 1 024bit modulus N and 1 024bit exponential d, and is sixteen times with 2 048bit N and 2 048bit d.
出处
《计算机应用研究》
CSCD
北大核心
2005年第11期128-129,132,共3页
Application Research of Computers
基金
浙江省自然科学基金重点项目(ZD0101)
浙江省教育厅高校科研计划项目(20030636)
国防科技重点实验室基金资助项目(51436040103DZ0401)
关键词
公钥密码
RSA
模幂算法
加密
多机协同计算
Public Key
RSA
Modular-Exponentiation Operation
Encryption
Multi-computer-cooperating Computation