2018 1st International Conference on Data Intelligence and Security

Hybrid Security RSA Algorithm in Application of

Web Service
Jayraj Gondaliya Jinisha Savani Vivek Sheetal Dhaduvai Gahangir Hossain
Electrical Engineering and Electrical Engineering and Electrical Engineering and Electrical Engineering and
Computer Science Computer Science Computer Science Computer Science
Texas A&M University- Texas A&M University- Texas A&M University- Texas A&M University-
Kingsville Kingsville Kingsville Kingsville
Kingsville, TX USA Kingsville, TX USA Kingsville, TX USA Kingsville, TX USA
jayraj_laljibhai.gondaliya@st [email protected] vivek_sheetal.dhaduvai@stud [email protected]
udents.tamuk.edu ents.tamuk.edu

Abstract—A new hybrid security algorithm is presented for RSA cryptography, two different keys are used- one key is public
cryptosystem named as Hybrid RSA. The system works on the which serves the encryption process while the another is
concept of using two different keys- a private and a public for private key which is assigned for the decryption process. The
decryption and encryption processes. The value of public key (P) public key cryptography is more secure than private key
and private key (Q) depends on value of M, where M is the
cryptography. The security of encryption scheme depends on
product of four prime numbers which increases the factorizing
of variable M. moreover, the computation of P and Q involves
the length of the key and the computational work.
computation of some more factors which makes it complex. This
states that the variable x or M is transferred during encryption Motivated by the research trends and challenges, Hybrid
and decryption process, where x represents the multiplication of RSA algorithm with four prime numbers has been proposed.
two prime numbers A and B. thus, it provides more secure path Here the keys are independent of variable x or M. Moreover,
for encryption and decryption process. The proposed system is it is possible to eliminate the transfer of x or M by replacing
compared with the RSA and enhanced RSA (ERSA) algorithms it with a newly computed value of x for the process of
to measure the key generation time, encryption and decryption encryption or decryption. As the key generation time
time which is proved to be more efficient than RSA and ERSA.
increases with increase in the speed of encryption or
decryption, it becomes challenging to attack the system and
Keywords: RSA, Cryptosystem, Network Security, Cyber
systems
the proposed technique becomes secure.

II. LITERATURE REVIEW

I. INTRODUCTION A. Algorithm
The ability to securely store and transfer sensitive Many algorithms have been proposed for public
information has proved critical factor in success. It is cryptography. In RSA algorithm, it is assumed that it is
important to secure Data for a confidential transmission. It difficult to find the factor of large integers and hard to find the
becomes essential to protect information from unauthorized decryption key. But as decryption was based directly on
users. This information should be available and open only for variable x; it was easy to factorize and derive the key. To
the authorized users and protected by disclosing and making improve the security enhanced RSA (ERSA) was proposed by
it unavailable for unauthorized users. Thus confidentiality considering the third prime number to increase complexity;
integrity and availability becomes the most important factors but the original message can be acquired directly. Thus direct
for secure data transmission. attack may harm both RSA and ERSA. A new algorithm with
some new factors were computed to increase the complexity
In recent times, cryptography has turned into battleground. in encryption as well as decryption process. But use of many
It is a method of storing and transmitting data in a form so that parameters overloaded the system. A new algorithm was
only those for whom it is intended can read and process introduced to overcome the advantages where the factor was
it. Two main classes of cryptography are “symmetric or replaced by a new factor which was difficult to trace back as
secret key” and “asymmetric or public key” cryptography. In it was the product of two prime numbers. But this achieved
symmetric cryptography, the system use same key for both increase in time complexity.
encryption and decryption processes. Whereas in asymmetric

978-1-5386-5762-1/18/$31.00 ©2018 IEEE 149

DOI 10.1109/ICDIS.2018.00032
 Another enhanced RSA was developed to overcome the instead of two prime numbers. The mathematical approach
limitations of above algorithm based on four prime numbers remains the same. It uses the same steps for the encryption
which helped to reduce direct attacks as private key and public and decryption process.
key are not dependent directly on component n, where n is the
product of two prime numbers. But this leads to the reduction ERSA_Key_Generation ()
in the speed of encryption and decryption process. Input: Select three random distinct prime numbers w, x and y.
Output: Find Public Key (U), Private Key (R) and Modulus (j).
Begin
B. Mathematical expression Procedure (w, x, y, U, R and j)
RSA Algorithm 1. j ← w * x * y
2. Calculate Euler Ø () of j
RSA is a “public key” cryptosystem. This algorithm is
Ø (j) ← (w-1) * (x-1)*(y-1)
based on variable x which is multiplication of two large prime 3. Generate a public key p, such that,
numbers a and b. the mathematical operation for this gcd (U, Ø (j)) = 1, 1< U < Ø (j)
algorithm can be shown as below. 4. Calculate the private key R, such that,
R ← U-1 mod (Ø (j))
RSA_Key_Generation () End Procedure
Input: Select two random distinct prime numbers w and x. End
Output: Find Public Key (U), Private Key (R) and Modulus (j).
Begin ERSA_Encryption ()
Procedure (w, x, U, R and j) Input: Select Plain text (T1), Public key (U) and
1. j ← w * x Modulus (j).
2. Calculate Euler Ø () of j Output: Find Cipher text (C1).
Ø (j) ← (w-1) * (x-1) Begin
3. Generate a public key U, such that, gcd (U, Ø (j)) = 1, 1< U < Procedure (T1, U, j and C1)
Ø (x) C1 ← TU mod j
4. Calculate the private key q, such that, End Procedure
R ← U-1 mod (Ø (j)) End
End Procedure
End ERSA_Decryption ()
Input: Select Cipher text (C1), Private key (R) and Modulus (j).
RSA_Encryption () Output: Find Plain text (T1).
Input: Select Plain text (T1), Public key (U) and Modulus (j). Begin
Output: Find Cipher text (C1). Procedure (T, U, j and C1)
Begin T ← CR mod j
Procedure (T1, U, j and C1) End Procedure
C1 ← TP mod j End
End Procedure
End It increases the security level as it increases the difficulty
with the analysis of variable x. However, the keys are directly
RSA_Decryption ()
dependent on x so the encryption and decryption complexity
Input: Select Cipher text (C1), Private key (R) and Modulus (j).
Output: Find Plain text (T1). is less. So direct attack is possible.
Begin
Procedure (T1, U, j and C1) III. METHOD
T1 ← C1 R mod j
End Procedure
A. The Proposed System
End The basic idea of this proposed model is that it uses four
prime numbers with the reduced size. The product of these
The public key and private key is dependent on variable x. four variables generates variable M. the public key (P) and
here, a plain text T is converted to cipher text C by the private key (Q) depends on the value of M, the computation
encryption process, and the original message T can be is indirect. The random numbers P1 and P2 () are required to
received by the decryption process. Where, C1= TU mod j; evaluate the value of P. So, it takes more time to generate the
T1= CR mod j; key due to increase in complexity. Moreover, the value of x
or M is not transmitted as a public key; instead, a newly
The algorithm works as follows. The value of a and b generated value of x i.e. w is transmitted as public key. The
provide the larger value of x which leads to higher value of q. process of encryption and decryption depends on w, so it is
and thus, chosen prime numbers decide the security of the difficult to break the system which makes it more secure. The
algorithm. It becomes easy to factorize the values as modulo algorithm can be described as follows.
x is just the multiplication of two prime numbers. And thus,
B. Algorithm
easy to obtain the decrypted original message.
HRSA_Key_Generation ()
 Enhanced RSA
Input: Select four random distinct prime numbers w, x, y and z.
Output: Find Public Key (U), Private Key (R) and
The concept of ERSA is almost the same as RSA with just Random number (r).
a minimal change in the input i.e we use three prime numbers Begin

150
 Procedure (w, x, y, z, U, R and r)
1. j ← w * x
2. k ← y * z
3. M ← j * k
4. Calculate Euler Ø( ) of j, k and M
a. Ø (j) ← (w-1) * (x-1)
b. Ø (k) ← (y-1) * (z-1)
c. Ø (M) ← Ø (j) * Ø (k)
5. Generate a random number r1, such that,
gcd (r1, Ø (x)) = 1, 1< r1 < Ø (j)
6. Generate a random number r2, such that,
gcd (r2, Ø (k)) = 1, 1< r2 < Ø (k)
7. Calculate R1 ← r1
r2 mod M
8. Generate a public key U, such that,
gcd (U, Ø (M) * R1) = 1, 1< U < Ø (M) * R1
9. Calculate the private key Q, such that,
R ← U-1 mod (Ø (M) * R1)
10. Compute a random number r, such that, Figure 1. Flow Chart at the Receiver side
If w>x
Satisfy j -w < r < j and gcd (r, j) = 1
Else if w<x
Satisfy j− x < r < j and gcd (r, j) = 1
End Procedure
End

HRSA_Encryption ()
Input: Select Plain text (T1), Public key (U) and Random
number (r).
Ouput: Find Cipher text (C1).
Begin
Procedure (T1, U, r and C1)
C1 ← TU mod r
End Procedure
End

HRSA_Decryption ()
Input: Select Cipher text (C1), Private key (U) and Random
number (r).
Output: Find Plain text (T1).
Begin
Procedure (C1, R, r and T1)
T1 ← C1R mod r Figure 2. Flowchart at the Sender Side
End Procedure
End V. RESULT
The proposed system uses MATLAB platform. We chose
IV. APPLICATION IS A WEB SERVICE two numbers of N/2- bit prime numbers for RSA, three
This model can be executed for trading information numbers of N/3- bit prime numbers for ERSA and four
between customer applications and web administrations. This numbers of N/4-bit prime numbers for HRSA. The superiority
upgrades security information trade between two customers of new proposed algorithm has been established by
utilizing web benefit as a middle person. It encodes the considering the parameters like key generation time,
substance piece which can be just unscrambled by customer encryption time and decryption time.
side, and not the web server.
A. Key generation time
Two separate modules are created – A windows application
(customer side) and a Web benefit (server side). The windows It is evident from the figure that the key generation time for
application program encodes the plain content information HRSA is higher compared to ERSA and RSA. From the
entered by customer utilizing half and half encryption and experiments it is proved that it is 84.66% higher than ERSA
conjures a web benefit. The web benefit gets the information and 64.43% higher than RSA. Figure 3 shows this result.
sent from windows application, and tries to unscramble the
information utilizing half and half decoding. After
information approval web benefit restores its reaction to the
customer program i.e. back to the windows application.

151
 VI. CONCLUSION
We proposed a new hybrid security cryptosystem, Hybrid
RSA, by using products of more than two large prime
numbers in the RSA-based cryptosystems to increase the
complexity of cracking the system. The proposed Hybrid
security algorithm for RSA called HRSA was proved
efficient. The key generation time, encryption time and
decryption time are the main parameters measured for the
efficiency. It was found that key generation time is more than
ERSA and RSA as both eth public key and private key
depends on variable M which is not directly dependent on the
value of module w: tracking back of the value of M is difficult,
which leads to higher security. Thus, it maintains
confidentiality of encryption and decryption process.
Sometimes (for the large prime) it might take long time for
Figure 3. Analysis of key generation time. key generation, encryption and decryption. The model cannot
be used in low powered devices. In future work, more
theoretical foundations will be provided to justify the
B. Encryption time proposed new cryptosystems with possibly significant
By experimental studies, it shows that there is modifications.
improvement of 64.37% more than ERSA and 66.85% more
than RSA. This is illustrated in figure 4. REFERENCES
[1] W. Stallings, “Cryptography and network security: principles and
practice”, sixth edition, 2014, ISBN: 0-13- 335469-5, pp. 9-60, 253-
285.
[2] B. Schneier, “Applied Cryptography: protocals, algorithm and source
code in ‘C’ ”, second edition, 1996, ISBN 0- 471-12845-7, pp.15-21.
[3] R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital
signatures and public key cryptosystems”, Communications of the
ACM vol. 21 (2), pp.120–126, 1978.
[4] A.H. Al-Hamami and Aldariseh IA, “Enhanced method for RSA
cryptosystem algorithm”, international conference on Advanced
Computer Science Applications and Technologies, Kuala Lumpur,
IEEE, pp. 402-408, 2012.
[5] R S Dhakar, A K Gupta and P Sharma, “Modified RSA encryption
algorithm (MREA)”, 2nd ICACCT, IEEE, pp. 426-429, 2012.
[6] R. Minni, K. Sultania and S.Mishra, “An algorithm to enhance security
in RSA” , 4th ICCCNT, IEEE , pp.1-4, 2013.
[7] M.Thangavel, P. Varalakshmi, M. Murrali and K.Nithya, “An enhanced
Figure 4. Analysis of encryption time and secured RSA key generation scheme” Journal of Information
Security and applications, Elsevier, vol 20, pp.3-10, 2015.
[8] Y. Li, Q. Liu and T. Li, “Design and implementation of an improved
RSA Algorithm”, International Conference on EHealth Networking,
C. Decryption time Digital Ecosystems and Technologies, Shenzhen, China, IEEE, pp.390-
An improvement of 60.55% than ERSA and 6 2.65% than 303, 2010.
RSA was exhibited by experimental studies. Figure 5 shows [9] F.Kong, J. Yu and L. Wu, “Security analysis of an RSA key generation
algorithm with a large private key”, Springer- Verlag Berlin Heidelberg,
decryption time comparison result. PP-95-101, 2011.
[10] W. Rui, C. Ju and D. Guangwen, “A k-RSA algorithm”, 3rd ICCSN,
Xi'an, China,IEEE, pp.21 24, 2011.
[11] L. H. Encinas, J. M. Masqu´e and A. Q. Dios, “An algorithm to obtain
a RSA modulus with a large private key”, Cryptology ePrint Archive:
Report 2003/045.
[12] S.J.Aboud, M A. AL-Fayoumi, M. AL Fayoumi and H.S.Jabbar, “An
efficient RSA public encryption scheme”, 5th International Conference
on information Technology:New Generations, Las Vegas, NV, IEEE,
pp.127-130,2008.
[13] B.R. Ambedkar, A. Gupta,P. Gautam and S.S.Bedi, "An Efficient
Method to Factorize the RSA Public Key Encryption." Communication
Systems and Network Technologies (CSNT), 2011 International
Conference on.
[14] Kalyani Ganesh Kadam, Prof. Vaishali Khairnar, International Journal
of Technical Research and Applications e-ISSN: 2320-8163,
www.ijtra.com Special Issue 31(September, 2015), PP. 51-56

Figure 5. Analysis of decryption time

152