| 四素数RSA加密算法的研究与分析 |
| |
| 引用本文： | 张宏,刘方园. 四素数RSA加密算法的研究与分析[J]. 微计算机信息, 2010, 0(15) |
| |
| 作者姓名： | 张宏 刘方园 |
| |
| 作者单位： | 哈尔滨理工大学计算机科学与技术学院; |
| |
| 摘 要： | RSA算法的密钥长度和执行效率之间的矛盾是RSA算法进一步发展的瓶颈,本文提出的四素数RSA算法是用四个短密钥,将密文分为四个模块,并运用中国剩余定理将高位宽大数的模幂运算转化为对低位宽相对较小的数进行模幂运算来快速实现解密的一种方法,来平衡加解密的计算成本。
|
| 关 键 词： | RSA算法 中国剩余定理 四素数 |
A research and analysis for four-prime RSA |
| |
| ZHANG Hong LIU Fang-yuan. A research and analysis for four-prime RSA[J]. Control & Automation, 2010, 0(15) |
| |
| Authors: | ZHANG Hong LIU Fang-yuan |
| |
| Affiliation: | ZHANG Hong LIU Fang-yuan(Computer Science , Technology College of Harbin University of Science , Technology Harbin 150080,China) |
| |
| Abstract: | The contradictory between the RSA algorithm of the key,s length and execution efficiency is the bottleneck of the further development of the RSA algotithm.In order to balance the cost of the computation of the canadia decipher,the four prime number RSA algorithm mentioned in the article is the way of fast relization decipher based on four short keys to be divided into four modules ciphertext and the use of Chinese Remainder Theorem.can make large number of high-power operation mode into a low wide of the nu... |
| |
| Keywords: | the RSA algorithm Chinese Remainder Theorem four prime numbe |
| 本文献已被 CNKI 等数据库收录！ |
|
