Professional Documents
Culture Documents
ScienceDirect
journal homepage: www.elsevier.com/locate/jisa
article info
abstract
Article history:
Public-key cryptography can be claimed as the greatest and an excellent revolution in the
Keywords:
Cryptosystem
The proposed algorithm makes use of four large prime numbers which increases the
RSA algorithm
Public key
only two large prime numbers. In the proposed Enhanced and Secured RSA Key Gener-
Private key
ation Scheme (ESRKGS), the public component n is the product of two large prime
Encryption
numbers but the values of Encryption (E) and Decryption (D) keys are based on the
Decryption
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.
2014 Elsevier Ltd. All rights reserved.
1.
Introduction
Security is the concept of keeping information secret by protecting it from unauthorized users. In order to keep a data
secured it must be hidden from unauthorized access (confidentiality), prevented from modifications (integrity) and
* Corresponding author.
E-mail address: thangavelmuruganme@gmail.com (M. Thangavel).
http://dx.doi.org/10.1016/j.jisa.2014.10.004
2214-2126/ 2014 Elsevier Ltd. All rights reserved.
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
2.
Related works
2.1.
RSA cryptosystem based on n prime numbers
(Ivy et al., 2012)
In this work, RSA was modified with the introduction of four
prime numbers. The algorithm is described as follows.
ALGORITHM 2.1. RSA CRYPTOSYSTEM BASED ON N PRIME
NUMBERS
2.2.
Encryption and decryption using secure RSA
(Jamgekar and Joshi, 2013)
In this approach, complexity was brought in the computation
of cipher text from plain text. A similar level complexity was
also used in the decryption part. The algorithm can be
described as follows.
ALGORITHM 2.2. ENCRYPTION AND DECRYPTION USING
SECURE RSA
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
2.3.
2011)
3.
The approach eliminated the need to transfer n. So it becomes
difficult for the hackers to derive at the prime numbers used.
The algorithm can be described as follows. The disadvantage
of the system is that the attacker can easily attack the system
with the value ofkp and d known.
ALGORITHM 2.3. MODIFIED RSA ALGORITHM
Proposed model
3.1.
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
3.2.
The encryption is done with the help of the public components and decryption is done with the help of the private
components. The encryption and decryption are based on n
but the computation of keys is not based on n but on N. This
makes the system secure and not easily breakable. The algorithm is presented below.
ALGORITHM 3.2. ESRKGS ENCRYPTION & DECRYPTION
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
4.
Key generation
time (in ms)
Encryption
time (in ms)
Decryption time
(in ms)
Total execution
time (in ms)
113
165
237
389
1168
11,164
181,811
1.5
2
3
16
105
784
6620
1.3
2
2
16
106
745
6647
115.8
169
242
421
1379
12,693
195,078
(1)
(2)
(3)
5.
5.1.
Hence,
ED 1$mod FN*E1 1$mod p 1q 1r 1s 1*E1
1 kp 1q 1r 1s 1*E1
(4)
(k is any positive integer)
Substituting (4) in (3)
CD mod n M1kp1q1r1s1*E1 mod n
M*Mkp1q1r1s1*E1 mod n
kq1r1s1*E1
M* Mp1
mod p*q
p1 kq1r1s1*E1
mod p*q
M* M
M*Mp1kq1r1s1*E1 mod p*q
Performance analysis
Key Generation
Time (in ms)
Encryption Time
(in ms)
Decryption
Time (in ms)
Total Execution
Time (in ms)
72
92
133
352
889
4315
91,542
1
1.1
1
3
21
183
1380
1
1.1
1.1
3
22
169
1381
74
94.2
135.1
358
932
4667
94,303
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
Key generation
time (in ms)
Encryption time
(in ms)
Decryption time
(in ms)
Total execution
time (in ms)
110
144
216
313
922
7471
93,899
2
2.5
4
21
170
1393
10,907
1.7
2.2
3
23
169
1379
10,957
113.7
148.7
223
357
1261
10,243
115,763
5.2.
Security analysis
6
8
10
12
16
RSA2
ESRKGS
1.083344
1.574581
4.047046
75.706760
14,961.466536
2.645654
5.383928
18.146578
123.498494
61,928.389156
7.855621
12.383894
32.492047
234.950321
126,473.290471
10
j o u r n a l o f i n f o r m a t i o n s e c u r i t y a n d a p p l i c a t i o n s 2 0 ( 2 0 1 5 ) 3 e1 0
6.
Conclusion
references