The week's pick
Reseach Article
Modifications in RSA through Positive Justification of Random Components
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 75 - Number 12 |
| Year of Publication: 2013 |
| Authors: Pallavi Jindal, Vikas Gupta |
10.5120/13162-0831
|
Pallavi Jindal, Vikas Gupta . Modifications in RSA through Positive Justification of Random Components. International Journal of Computer Applications. 75, 12 ( August 2013), 12-16. DOI=10.5120/13162-0831
Abstract
There is a surge of interest today in Wireless Networks both for organizations and individuals. It's emerging as general consensus that the current generation as well as next generation will have more of wireless connectivity. However, wireless networks have many security problems. Effective Wireless Security policies are required as wireless networks have been found to be relatively easy to break in by the hackers. The various techniques are being used for counteracting security risks. The most prevalent algorithm warranting security is RSA . RSA, a public - key cryptography algorithm is based on the factorization of large prime numbers. Presently the use of 512 bits keys are considered as insecure keys after the successful attack and by implementing the General Number Field Sieve (GNFS) algorithm . It has still got gaps of security that needs to be handled. In this, modifications has been proposed in RSA 512 bit and modified RSA through positive justification of alphabets through appending in the plain text and prime numbers in cipher text through multiplication to make the communication more secure. As the large prime numbers are not easily perishable, this modification will provide reliability over the network . This paper proposes a modification in classical RSA and modified RSA in which random numbers are appended in cipher text leading to improvement in previous results. The introduction of positive justification in this paper will make access to the message cumbersome even after having the access to the private key.
References
- Atul Kahate, Cryptography and Network Security, ISBN-10:0-07-064823-9, Tata McGraw Hill Publishing Company Limited, India, Second Edition, pages 38-62,152-165,205-240.
- Amit Kumar Gupta, Ravi Shankar Dhakar, Prashant Sharma, Modified RSA Encryption Algorithm (MREA), ACCT'12 proceeding of 2012 Second international conference on Advance computing and communication technologies page 426-429
- H. Otrok, PhD student, ECE Department, Concordia University, Montreal, QC, Canada and R. Haraty, Assistant Dean, School of Arts and Sciences, Lebanese American University, Beirut, Lebanon and A. N. El-Kassar, Full Professor, Mathematics Department, Beirut Arab University, Beirut, Lebanon "Improving the Secure Socket Layer Protocol by modifying its Authentication functions" 2006
- Yogesh Joshi, Debabrata Das, Subir Saha, International Institute of Information Technology Bangalore (IIIT-B), Electronics City, Bangalore, India. "Mitigating Man in the Middle Attack over Secure Sockets Layer, 2009
- Parshotam, Rupinder Cheema and Aayush Gulati "Improving the Secure Socket Layer by Modifying the RSA Algorithm" International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol. 2, June 2012
- RSA website, 3. 1 RSA, www. rsasecurity. com.
- Aayush Chhabra, Srushti Mathur "Modified RSA Algorithm: A Secure Approach" International Conference on Computational Intelligence and Communication Systems,2011
- Dhananjay Pugila, Harsh Chitral2, Salpesh Lunawat, "An Efficient Encryption Algorithm Based On Public Key Cryptography" International Journal of Engineering and Technology, July 2013
- W. Stallings, "Cryptography and Network Security", 2nd ed. , Prentice Hall, Upper Saddle River, NJ, 1999.
Index Terms
Keywords