Journal of Guangdong University of Technology ›› 2005, Vol. 22 ›› Issue (4): 79-82.

• Comprehensive Studies • Previous Articles     Next Articles

Selecting Method of Addition Chains in RSA Cryptosystem

  

  1. (1.Faculty of Applied Mathematics,Guangdong University of Technology,Guangzhou 510090,China;2.Dept.of Computer,Guangdong University of Foreign Studies,Guangzhou 510420,China)
  • Online:2005-10-07 Published:2005-10-07

HTML

0

PDF (PC)

2323

Abstract: In this paper,according to implement of RSA algorithm,the shorter addition chains is found through using the window method,and the calculation speed of modular exponentiation is increased in RSA cryptosystem.

Key words: addition chains； modular exponentiation； RSA cryptosystem；

[1] 陈智敏.  RSA公钥体制中快速大整数乘法的实现[J]. 广州大学学报(自然科学版). 2002(03)

[2] 陈智敏.  RSA公钥密码体制中的模乘算法[J]. 通信技术. 2002(12)

[1] Daniel Bleichenbacher,Achim Flammenkamp.An efficient algorithm for computing shortest addition chains. SIAM Jour-nal of Discrete Mathematics . 1997
No related articles found!
Viewed
Full text
1946
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 1946

  From Others local
  Times 445 1501
  Rate 23% 77%

Abstract
210
Just accepted Online first Issue
0 0 210
  From Others local
  Times 42 168
  Rate 20% 80%

Cited
Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech