期刊文献+

改进的RSA密码算法的并行化实现 被引量:1

Parallel implementation of improved RSA cryptographic algorithm
下载PDF
导出
摘要 针对现有的RSA(Rivest-Shamir-Adelman)算法在云环境下运行速度慢的问题,提出了一种改进的RSA算法,该算法的基本思想是通过将RSA算法中部分解密端的计算量转移到加密端的方式,并且将统一计算设备架构(CUDA)的并行化实现技术应用于算法的解密端,在解密过程中大量引入并行的模乘线程来提高RSA算法模幂运算的速度,以达到加快解密的目的。实验结果表明,该算法相对于原RSA算法,解密速度可获得最大为10的加速比。 As the existing RSA algorithm runs slowly in a cloud environment, an improved RSA algorithm was proposed to improve the efficiency of RSA. The method mainly included some of computation during the decryption was moved to the encryption end. A Compute Unified Device Architecture (CUDA) parallel realization technology was involved in decryption. And a mass of paralleled threads of modular multiplication were used to speed up the modular exponentiation and the decryption in RSA algorithm. The experiment results show that the CUDA implementation can achieve more than 10 times speedup in comparison with the original RSA algorithm.
出处 《计算机应用》 CSCD 北大核心 2013年第A01期32-34,61,共4页 journal of Computer Applications
基金 云南省软件工程重点实验室开放基金资助项目(2011SE08)
关键词 云计算 RSA算法 负载转移 并行 统一计算设备架构 cloud computing Rivest-Shamir-Adleman(RSA) algorithm load transfer parallelization Compute Unified Device Architecture(CUDA)
  • 相关文献

参考文献14

  • 1JOUX A. Muhicolisions in iterated Hash functions, application tocascaded constructions [ C]// Crypto 04,LNCS 3152, Berlin:Springer-Verlag, 2004: 306 — 316.
  • 2冯登国.国内外密码学研究现状及发展趋势[J].通信学报,2002,23(5):18-26. 被引量:136
  • 3RIVEST R, SHAMIR A, ALDEMAN L. A method for obtaining digit-al signatures and public-key cryptosystems [ J ]. Communications ofthe ACM, 1978,21(2):120-126.
  • 4曹建国,王丹,王威.基于RSA公钥密码安全性的研究[J].计算机技术与发展,2007,17(1):172-173. 被引量:22
  • 5MONTGOMERY P L. Modular multiplication without trial division[J]. Mathematics of Computation, 1985,44( 1): 519-521.
  • 6薛念,潘赟,张宇弘,严晓浪.基于Montgomery模乘的RSA加密处理器[J].计算机工程,2010,36(13):125-127. 被引量:6
  • 7MATSUMOTO T,KATO K. Speeding up secret computations withinsecure auxiliary device[ C]// Proceedings of the 8th Annual Inter-national Crypto Conference on Advances in Cryptology. London:Springer-Verlag,1988:497 -506.
  • 8CASTELLUCCIA C, MYKLETUN E, TSUDJK G. Improving secureserver performance by re-balancing SSL /TLS handshakes [ C]//Proceedings of ACM Symposium on Information, Computer and Com-munications Security. New York: ACM Press, 2006 : 26 - 34.
  • 9张舒,褚艳利.GPU高性能计算之CUDA[M].北京:中国水利水电出版社.200910:213.
  • 10Nvidia. Nvidia CUDA compute unified device architectureprogramming guide version 2. 0[ EB/OL]. (2008- 06- 07) [ 2012-11-01]. http: //www. nvidia. com/object/cuda_home. html.

二级参考文献43

  • 1Montgomery P L.Modular Multiplication Without Trial Division[J].Mathematics of Computation,1985,44(1):519-521.
  • 2Kwon T W,You C S,Heo W S,et al.Two Implementation Methods of a 1024-bit RSA Cryptoprocessor Based on Modified Montgomery Algorithm[C] //Proc.of ISCAS'01.Sydney,NSW,Australia:IEEE Press,2001.
  • 3Banimov V,Schimmler M,Tolg B.A Complexity-effective Version of Montgomery's Algorithm[C] //Proc.of ISCA'02.Anchorage.Alaska,USA:[s.n.] ,2002.
  • 4Mcivor C,Mcloone M,Mccarmy J V.Modified Montgomery Modular Multiplication and RSA Exponentiation Techniques[J].IEEE Proceedings of Computers and Digital Techniques,2004,151(6):402-408.
  • 5Fang Gang,Ma Guangsheng,Yang Zhi.Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm[C] //Proc.of International Conference on Scientific Computing.Las Vegas,Nevada,USA:[s.n.] ,2006.
  • 6Hu Zhengbing,Shboulr R M,Shirochin V P.An Efficient Architecture of 1024-bits Cryptoprocessor for RSA Cryptosystem Based on Modified Montgomery's Algorithm[C] //Proc.of IDAACS'07.Dortmund,Germany:[s.n.] ,2007.
  • 7Ming-Der Shieh,Jun-Hong Chen,Hao-Hsuan Wu,et al.A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem[J].IEEE Transactions on Very Large Scale Integration(VLSI)Systems,2008,16(9):1151-1161.
  • 8Jye-Jong Leu,An-Yeu Wu.Design Methodology for Booth-encoded Montgomery Module Design for RSA Cryptosystem[C] //Proc.of ISCAS'00.Geneva,Switzerland:[s.n.] ,2000.
  • 9RIVEST R, SHAMIR A, ALDEMAN L. A method for obtaining digital signatures and public-key cryptosystems [ J]. Communications of the ACM, 1978, 21(2) : 120 - 126.
  • 10COLLINS T, HOPKINS D, LANGFORD S, et al. Public key cryptographic apparatus and method: US, 4218582 [ P]. 1997.

共引文献205

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部