Data Encryption and Decryption Using Modified RSA Cryptography Based on Multiple Public Keys and ‘n’prime Number
Keywords:
Cryptography, RSA algorithm, Triple DES, Asymmetric key Cryptography, 'n' Prime NumberAbstract
Now a days, have a great dependence on computer and network and the security of computer related to the whole world and everybody. Cryptography is the art and science of achieving security by encoding message to make them non-readable [1] to secure data or information transmits over the network. In this paper introduced modified RSA approach based on multiple public keys and n prime number.RSA algorithm is mostly used in the popular implementation of public key cryptography. In public key cryptography two different keys are generated in RSA one keys is used in encryption data and other corresponding key used for decryption. No other key decrypt the data. Even if it is efficient algorithm it is vulnerable to other person. With the help of all brute force attacks can obtain private keys. In this research paper new approach we used n prime number and multiple public keys. Which is not easily crack able .In here implementation RSA algorithm .using some mathematical logic integer factorization and discrete logarithm problem.
References
AAtul Kahate, Cryptography and Network Security, Tata McGraw-Hill Publication Company Limited page no. 32 2003.
Xiaowen Kang; Inst. of Electron. Technol., PLA Inf. Eng. Univ., Beijing; Yingjie Yang; Xin Du,” A Disaster-Oriented Strong Secure File System” Innovative Computing Information and Control, 2008. ICICIC '08. Pages 557.
Xin Zhou, Xiaofei Tang,”Reasearch and Implementation of RSA algorithm for Encryption and Decryption “IEEE 6th International Forum on strategic Technology pp 1118-1121, 2011.
Rajan.s.jamgekar, Geeta shantanu joshi “File Encryption and Decryption using secure RSA” International Journal of Emerging Science and Engineering (IJESE) ISSN: 2319–6378, Volume-1, Issue-4, February 2013.
P.Saveetha & S.Arumugam “Study on Improvement in RSA Algorithm and its Implementation” International Journal of Computer & Communication Technology ISSN (PRINT): 0975 - 7449, Volume-3, Issue-6, 7, 8, 2012
en.wikipedia.org/wiki/Euclidean algorithm
B.Persis Urbana Ivy, Purshotam Mandiwa. Mukesh Kumar “A modified RSA cryptosystem based on ‘n’ prime numbers” International Journal of Engineering and Computer Science ISSN: 2319-7242 Volume1 Issue 2 Nov 2012 Page No. 63-66
en.wikipedia.org/wiki/Random_number_generation
Avinash kak, Purdue University Lecture Notes on “Computer and Network Security”June 20, 2003
Milad Bahadori1, Mohammad Reza Mali, Omid Sarbishei, Mojtaba Atarodi, Mohammad Sharifkhani,”Novel Approach witch is the Secure and Fast Generation of RSA Public and Private Keys on Smart-Card”, 978-1-4244-6805-8/10/$26.00 2010 IEEE.
Maryam Ahmed, Baharan Sanjabi, Difo Aldiaz, Amirhossein Rezaei, Habeeb “Diffie-Hellman and Its Application in Security Protocols” International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 1, Issue 2, November 2012
P. Golle, J. Staddon, M. Gagne, and P. Rasmussen, “A Content-Driven Access Control System,” Proc. Symp. Identity and Trust on the Internet, pp. 26-35, 2008.
Rangarajan A. Vasudevan, Sugata Sanyal” Jigsaw-based Secure Data Transfer over Computer Networks” Information Technology: Coding and Computing,. Proceedings. ITCC 2004. International Conference on (Volume:1 ) 2004.
Wuling Ren, Zhiqian Miao, College of Computer and Information Engineering, Zhejiang Gongshang University, “A Hybrid Encryption Algorithm Based on DES and RSA” in Bluetooth Communication Second International Conference on Modeling, Simulation and Visualization Methods 2010.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
