International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 121 - Number 23 |
Year of Publication: 2015 |
Authors: Arvind Negi, Punit Sharma, Prasant Chaudhary, Himanshu Gupta |
10.5120/21841-5084 |
Arvind Negi, Punit Sharma, Prasant Chaudhary, Himanshu Gupta . New Method for Obtaining Digital Signature Certificate using Proposed RSA Algorithm. International Journal of Computer Applications. 121, 23 ( July 2015), 24-29. DOI=10.5120/21841-5084
Digital signature schemes are mostly used in cryptographic protocols to provide services like entity authentication, authenticated key transport and authenticated key agreement. It is used in a variety of applications to ensure the integrity of data exchanged or stored and to prove to the recipient the inventor's identity. There are many other algorithms which are based on the prime factorization and discrete logarithms problem but different weaknesses and attacks have been developed against those algorithms. This Research paper presents proposed scheme of digital signature algorithm which is based on factoring the product of two large prime numbers, the factoring problem with RSA algorithm using minimum two integer numbers. Proposed scheme of RSA have better security feature that involves the use of multiple integer numbers. As RSA has its own security issues that only a single integer number is used and is capable of generating single signature only. So for the purpose of security, proposed scheme has been presented which is comparatively much more secure and involves the use of multiple integer numbers to the primary integer number and increases difficulty of decryption key. The significant aspect of this proposed idea is that multiple public key exponents and private key exponents are used.