Comparative Analysis of RSA and Modified RSA Cryptography

Madhurima Dubey*, Yojana Yadav**
* PG Scholar, Department of Electronics and Telecommunication Engineering, Chhatrapati Shivaji Institute of Technology, Durg, India.
** Associate Professor, Department of Electronics and Telecommunication Engineering, Chhatrapati Shivaji Institute of Technology, Durg, India.
Periodicity:December - February'2016


In RSA (Rivest-Shamir-Adleman) cryptography, the basic factors are key length, calculation time, security, authentication and integrity. Generally, in public key cryptography, the key length and security is directly proportional to each other. Original RSA uses two prime numbers as input, which gives the modulus 'n'; encryption and decryption process depends on modulus 'n'. The attacker can easily break the 'n' into two factors of prime number and so to avoid this problem, the authors have used three large prime numbers, it will increase the brute force time to factorize 'n'. This paper mainly focuses on the number of prime numbers used, security and time.


RSA Algorithm, Public Key Cryptography, Encryption, Decryption.

How to Cite this Article?

Dubey, M., and Yadav, Y. (2016). Comparative Analysis of RSA and Modified RSA Cryptography. i-manager’s Journal on Computer Science, 3(4), 23-28.


[1]. Srinivasan Nagaraj, Raju and V. Srinadth, (2015). “Data Encryption and Authentication using Public Key Approach”. International Conference on Intelligence Computing, Communications and Convergence, pp.126-132.
[2]. Sarika Khatarkar and Rachana Kamble, (2015). “A Survey and Performance Analysis of Various RSA based Encr yption Techniques”. International Journal of Computer Applications, Vol.114, No.7, pp. 30-33.
[3]. Joshi Maitri and Fenil Khatiwala, (2015). “Survey of Different Modified RSA Techniques and Analysis”. International Journal of Engineering Technology, Management and Applied Sciences, Vol.3, No.2, pp.126-132.
[4]. Shyam Deshmukh and Prof. Rahul Patil, (2014). “Hybrid Cryptography Technique using Modified Diffie- Hellman and RSA”. International Journal of Computer Science and Information Technologies, Vol.5, No.6, pp.7302-7304.
[5]. Ali E. Taki El_Deen, El-Sayed A. El-Badawy and Sameh N. Gobarn, (2014). “Digital Image Encryption Based on RSA Algorithm”. International Journal of Electronics and Communication Engineering, Vol.9, No.1, pp.69-73.
[6]. Norhidayah Muhammad, Jasni Mohamad Zain and Md Yazid Mohd Saman, (2013). “Loop Based RSA Key th Generation Algorithm using String Identify ”. 13 International Conference on Control, Automation and System, pp.255-258.
[7]. B. Persis Urbana Ivy, Purshotam Mandiwa and Mukesh Kumar, (2013). “A Modified RSA Cryptosystem based on 'n' Prime Numbers”. International Journal of Research in Science and Engineering, Vol.1, No.8, pp.63-66.
[8]. Nentawe Y. Goshwe, (2013). “Data Encryption and Decr yption Using RSA Algorithm in a Network Environment”. International Journal of Computer Science and Network Security, Vol.13, No.7.
[9]. S.H. Mortazavi and P.S. Avadhani, (2013). “RSA Cr yptography Algorithm : An Impressive Tool in Decresasing Intrusion Detection System ( IDS ) Vulnerabilities in Network Security ”. International Journal of Innovative Technology and Exploring Engineering, Vol.2, No.4, pp. 306-310.
[10]. Alaa Hussein Al-Hamami and Ibrahem Abdallah Aldariseh, (2012). “Enhanced Method for RSA Cryptosystem Algorithm”. IEEE International Conference on Advanced Computer Science Applications and Technologies, pp.402-408.
[11]. Sami A. Nagar and Saad Alshamma, (2012). “High Speed Implementation of RSA Algorithm with Modified th Keys Exchange”. IEEE 6 International Conference on Science of Electronics, Technologies of Information and Telcommunication, pp.639-642.
[12]. Shilpi Gupta and Jaya Sharma, (2012). “A Hybirid Encryption Algorithm based on RSA and Diffie-Hellman”. IEEE International Conference on Computational Intelligent and Computing Research, pp.1-4.
[13]. Ravi Shankar Dhakar and Amit Kumar Gupta, (2012). “Modified RSA Encryption algorithm (MERA)”. IEEE nd 2 International Conference on Advanced Computing and Commnication Technologies, pp.426-429.
[14]. Vishal Grag and Rishu, (2012). “Improved Diffie- Hellman Algorithm for Network Security Enhancement”. International Journal of Computer Technology and Applications, Vol.3, No.4.
[15]. P. Saveetha and S. Arumugam, (2012). “Study of Improvement in RSA Algorithm and its Implementation”. International Journal of Computer and Communication Technology, Vol.3, No.6.
[16]. Xin Zhou and Xiaofei Tang, (2011). “Research and Implementation of RSA Algorithm for Encryption and th Decryption”. IEEE The 6 International Forum on Strategic Technology, pp.1118 - 1121.
[17]. Liang Wang and Yonggui Zhang, (2011). “A New Personal Information Protection Approach Based on RSA Cryptography”. IEEE International Symposium on IT in Medicine and Education, pp.591-593.
[18]. Shashi Mehrotra Seth and Rajan Mishra, (2011). “Comparitive Analysis of Encryption Algorithms For Data Communication”. International Journal of Computer Science and Technology, Vol.2, No.2, pp. 292-294.
[19]. Wenxue Tan, Xiping Wang, Xiaoping Lou and Meisen Pan, (2011). “Analysis of RSA based on Quantitating Key Security Strength”. Advanced in Control Engineering and Information Science, pp.1340-1344.
[20]. Sonal Sharma, Prashant Sharma and Ravi Shankar Dhakar, (2011). “RSA Algorithm Using Modified Subset Sum Cryptosystem”. IEEE International Conference on Computer & Communication Technology, pp.457-461.
[21]. Yunfei Li, Qing Liu and Tong Li, (2010). “Design and Implementation of an Improved RSA Algorithm”. IEEE International Conference on E-Health Networking, Digital Ecosystems and Technologies, pp.390-393.
[22]. Allam Mousa, (2005). “Sensitivity of Changing the RSA Parameter on the Complexity and Performance of the Algorithm”. Journal of Applied Science, Vol.5, No.1, pp.60-63.
[23]. Aloka Sinha and Kehar Singh, (2003). “A Technique for Image Encryption using Digital Signature”. Optic Communications, pp.239-234.
[24]. Subbarao V. Wunnava and Ernest Rassi, (2002). “Data Encryption Performance and Evaluation Schemes”. IEEE Proceedings of Southeastcon, pp.234-238.
[25]. David A. Carts, (2001). “A Review of the Diffie- Hellman Algorithm and its use in Secure Internet Protocol”. SANS Institute, pp.1-7.
[26]. Rajorshi Biswas and Shibdas Bandyopadhyay, “A Fast Implementation of the RSA Algorithm Using the GNU Implementation”. Retrived from: http//www.alumni.cs.
[27]. Atul Kahate, (2013). Cryptography and Network Security. Fourth Edition, Tata McGraw-Hill.
[28]. William Stallings, (2010). Cryptography and Network Security – Principles and Practice. Fifth Edition, Pearson Publication.
[29]. R.L. Rivest, A. Shamir and L. Adleman, (1978). “A Method for Obtaining Digital Signatures and Public Key Cryptosystem ”. Communication of ACM, Vol.21, pp.120- 126.
[30]. Gaurav R Patel, Kurnal Panchal, and Sarthak R. Patel, (2013). “A Comprehensive Study on a various Modifications in RSA Algorithm”. International Journal of Engineering Development and Research, Vol.1, No.3, pp.161-163.

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

If you have access to this article please login to view the article or kindly login to purchase the article
Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.