An Enhanced and Secured RSA Key Generation Scheme (ESRKGS)

Public-key cryptography can be claimed as the greatest and an excellent revolution in the field of cryptography. A public-key cryptosystem is used for both confidentiality and authentication. One such public-key cryptosystem is the RSA cryptosystem. In this paper, a modified and an enhanced scheme based on RSA public-key cryptosystem is developed. The proposed algorithm makes use of four large prime numbers which increases the complexity of the system as compared to traditional RSA algorithm which is based on only two large prime numbers. In the proposed Enhanced and Secured RSA Key Generation Scheme (ESRKGS), the public component n is the product of two large prime numbers but the values of Encryption (E) and Decryption (D) keys are based on the product of four large prime numbers (N) making the system highly secured. With the existing factorization techniques, it is possible only to find the primes p and q. The knowledge of n alone is not sufficient to find E and D as they are based on N. The time required for cryptanalysis of ESRKGS is higher than traditional RSA cryptosystem. Thus the system is highly secure and not easily breakable. A comparison is done between the traditional RSA scheme, a recent RSA modified scheme and our scheme to show that the proposed technique is efficient.

[1]  Neal R. Wagner,et al.  The Laws of Cryptography with Java Code , 2003 .

[2]  Rajan. S. Jamgekar,et al.  File Encryption and Decryption Using Secure RSA , 2013 .

[3]  Sachin Mahajan,et al.  Performance Evolution of RSA and New Cryptosystem , 2012 .

[4]  Chung-Hsien Wu,et al.  RSA cryptosystem design based on the Chinese remainder theorem , 2001, Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455).

[5]  Carl Pomerance,et al.  A Tale of Two Sieves , 1998 .

[6]  Behrouz A. Forouzan,et al.  Cryptography and network security , 1998 .

[7]  Srushti Mathur,et al.  Modified RSA Algorithm: A Secure Approach , 2011, 2011 International Conference on Computational Intelligence and Communication Networks.

[8]  Durai Raj Vincent,et al.  An algorithm to enhance security in RSA , 2013, 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT).

[9]  P. Ribenboim.  The new book of prime number records , 1996 .

[10]  Hamza Ali,et al.  Timing Attack Prospect for RSA Cryptanalysts Using Genetic Algorithm Technique , 2004, Int. Arab J. Inf. Technol..

[11]  R. Vijayaragavan,et al.  Pell's RSA key generation and its security analysis , 2013, 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT).

[12]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[13]  Tong Li,et al.  The Research of the Batch RSA Decryption Performance , 2011 .

[14]  N. Ravi Shankar,et al.  A Novel Modular Multiplication Algorithm and its Application to RSA Decryption , 2012 .

[15]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[16]  Behrouz A. Forouzan.  Cryptography & Network Security , 2007 .

[17]  Alaa Hussein Al-Hamami,et al.  Enhanced Method for RSA Cryptosystem Algorithm , 2012, 2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT).

[18]  Prashant Sharma,et al.  RSA algorithm using modified subset sum cryptosystem , 2011, 2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011).

[19]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .