首页 | 本学科首页   官方微博 | 高级检索  
     

基于中国剩余定理的RPrime RSA算法的快速实现
引用本文:陈作新. 基于中国剩余定理的RPrime RSA算法的快速实现[J]. 科技情报开发与经济, 2011, 21(35): 174-175
作者姓名:陈作新
作者单位:辽宁科技大学图书馆,辽宁鞍山,114051
摘    要:
RPrime RSA有效地将Rebalanced RSA的密钥产生算法和RPrime RSA的解密算法组合在一起,加快了解密速度。运用中国剩余定理实现了RPrime RSA的解密算法,减少了求逆元的个数,提高了效率。

关 键 词:RPrimeRSA算法  中国剩余定理  解密

The Fast Implementation of RPrime RSA Algorithm Based on Chinese Remainder Theorem (CRT)
CHEN Zuo-xin. The Fast Implementation of RPrime RSA Algorithm Based on Chinese Remainder Theorem (CRT)[J]. Sci-Tech Information Development & Economy, 2011, 21(35): 174-175
Authors:CHEN Zuo-xin
Affiliation:CHEN Zuo-xin
Abstract:
RPrime RSA can effectively combine Rebalanced RSA's cipher-key generation algorithm and RPrime RSA's decryption algorithm,which speeds up the Decryption speed.Based on CRT,this paper realizes RPrime RSA's decryption algorithm,reducing the number of solving inverse elements and improving the efficiency of decryption.
Keywords:RPrime RSA algorithm  CRT  decryption
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号