DocumentCode :
3224180
Title :
An Efficient Implementation of RSA Digital Signature Algorithm
Author :
Cao, Ying-yu ; Fu, Chong
Author_Institution :
Sch. of Inf. Sci. & Eng., Northeastern Univ., Shenyang
Volume :
2
fYear :
2008
fDate :
20-22 Oct. 2008
Firstpage :
100
Lastpage :
103
Abstract :
RSA is the most widely used digital signature algorithm in e-commerce and the complexity of large integer operation is the main factor that affects the efficiency of a RSA system. In this paper, a n carry array based large integer denotation approach is proposed to speed up the large integer calculation in RSA key generation and data encryption/decryption process, so as to improve the efficiency of a RSA system. The RSA digital signature algorithm and its mathematic foundation are discussed in detail and the feasibility of RSA algorithm is proved. An integrated large integer library is built by using C++ and the implementations of Miller-Rabin, extended Euclid and Montgomery algorithms for complex numeric operations in RSA are given.
Keywords :
computational complexity; digital signatures; public key cryptography; C++ language; Miller-Rabin algorithm; Montgomery algorithm; RSA digital signature algorithm; RSA key generation; carry array based large integer denotation approach; computational complexity; data decryption; data encryption; e-commerce; extended Euclid algorithm; integrated large integer library; Automation; Business; Cryptography; Data security; Digital signatures; Information science; Mathematics; Public key; Software algorithms; Software libraries;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computation Technology and Automation (ICICTA), 2008 International Conference on
Conference_Location :
Hunan
Print_ISBN :
978-0-7695-3357-5
Type :
conf
DOI :
10.1109/ICICTA.2008.398
Filename :
4659731
Link To Document :
بازگشت