ISSN (Print) : 0974-6846

Indian Journals of Science and Technology, Vol 9(20), DOI: 10.17485/ijst/2016/v9i20/70417, May 2016 ISSN (Online) : 0974-5645

Performance Evaluation of Encryption/Decryption

Mechanisms to Enhance Data Security
Narander Kumar* and Priyanka Chaudhary
Department of Computer Science, B. B. A. University (A Central University), Lucknow - 226025, Uttar Pradesh India;
[email protected], [email protected]

Abstract
Objective: The foremost goal of this paper is to upgrade the security of information and processing speed utilizing symmetric
cryptographic technique based on ASCII value while transferring of information. The idea of this paper is to produce an
encoded content by giving plain text enter to symmetric cryptographic based on ASCII value and getting decoded text as
original text as original text by giving encrypted text symmetric cryptographic based on ASCII value. Method: In this paper,
we have proposed an algorithm which is established on the ASCII value to encode a plaintext. This algorithm randomly
generates a key for the person having a length equivalent to the length of the plaintext. The randomly generated key is
modified to one other key via substitution of position of key utilizing a random number and is used to decode decrypt the
message of original plaintext. Finding: GUI interface was developed using Java Net Beans IDE 8.0. Entire outcomes have
obtained using a computer with the following specifications: Intel Core i3 CPU and 1GB RAM. Improvement: Besides the
proposed algorithm utilized for this exploration, the other chance of utilizing different algorithm will be executed in future
work.

Keywords: Ciphertext, Cryptography, Cyber security, Decryption, Encryption, Plaintext

1. Introduction with out unique understanding decryption is the oppo-

site system. The technique of interpreting or transforming
Data security problem can be small and loacal and that an encrypted message is back to its readable and original
they can be international in scope, regarding computer shape. In encryption, we use various approach to encode
systems and business enterprise s on each continent1. To the message while in decryption. The previous understand-
avert any type of cataclysm, confidential data must be pro- ing of key or password is needed to decode the message. A
tected from intruders. Cyber security is an important role2. device for Encryption and decryption is referred to as cryp-
Generally, there’s a got to shield info from ‘praying eyes’. tosystem and approach used for enciphering constitute
Within the electronic age, the records that might differ- the location of examine of is referred to as cryptography.
ent wise gain or educate a collection or character also can Cryptography is that the observe of exploitation encoding
be used against such institution or people. Industrial spy- to hide text. Cryptographic system are represent as variety
ing among extremely competitive businesses usually need of process used for transforming encoded text to decoded
that in depth security live ought to be place into the place. text, wide variety of key used, approach that of process the
And people who desire to exercise their non-public facts to encoded text3.
avoid struggling the penalties of going towards the desires A. Mathur proposed, an ASCII value based Symmetric
of individual who attempt to manage. Encryption is the encryption algorithm. In this algorithm length of input
technique of encoding records to make it unpredictable data and the length of the key used are same. The key

*Author for correspondence

 Performance Evaluation of Encryption/Decryption Mechanisms to Enhance Data Security

used in the system is entered through user, manually. • Generate a random no of character according to
For manipulating the key used shift operation depends the length of plain text, i.e., 5 random no of char-
on the length of the input data. The proposed algorithm acter and store it into the key.
in4 takes more execution time in comparison of the pro- • Find the ASCII value of the key and store it in
posed mechanism in this paper. For network security, a the ASCII key value.
system is proposed in which we consider a various layer • Now generate a random no according the num-
of security rather than supportive single layer which at ber of lengths and store the value in a particular
once may fall through5. For secure communication an location through the generated no. (If two values
ant Colony Optimization Key Generation technique is is reached in the same value the increase the plus
presented which depending on image encryption tech- one as well as possible).
nique is defined in6. A set of cryptographic algorithm • Now apply value on the resultant position and
is analyzed for ensuring medical records in the connec- store into the new key value.
tion of mobile applications7. A technique is discussed in8 • Now find the final encryption key and add the
which uses three different wavelets for encoding an image again mod value of plain text in the ASCII value
along with the password. An algorithm is proposed that of final encryption key and find the cipher text.
is based on Message Encoding Algorithm (MsgEncA) for
security purposes which produce better performance to 2.2 Decryption Algorithm
compare than existing is discussed in9. A security tech-
• There are find minimum ASCII code values of
nique is implemented to hide the information, i.e., based
each character from the cipher text.
on Advanced Encryption Standard is discussed in10.
• Now performing an operation such as subtrac-
Improved Elliptic Curve Cryptography mechanisms are
tion of the the ASCII code values of final encrypt
proposed for security purpose that is proposed in11. A
key from ASCII value of cipher.(Add 16 on
cryptography algorithm is implementing using through
stored position where we perform again mod
quasigroup-based endomorphic that is defined in12.
operation so the new differences value i.e. where
mod operation >16).
2. Proposed Mechanism • Add min ASCII value of cipher text with the
each value of difference which generate from
plaintext.
2.1 Encryption Algorithm
There are following steps are defined in the proposed A sequence diagram is presented in Figure 3 to show
encryption algorithm. the Encryption and decryption process. In this process a
precondition is sender and accepter has shared a same key
• Input the plain text without space and find the and access a repository of technique.
ASCII code value of each character as well as
store it in the ASCII plain content (array vari- 2.2.1 Encryption Process Description
able). • Sender sends a message (plain text, key, algo-
• Find the minimum ASCII value in this data and rithm identifier) to the encrypter.
it store in min ASCII value (variable). • Encryptor encrypt the message using with the
• The ASCII value (the simple text), % (Modulus algorithm that is specified by the sender
operation) with the minimum ASCII value (the • Encryptor creates the cipher text.
simple text), store it as the mod value of plain
text (array variable). (If the mod value of plain 2.2.2 Decryption Process Description
text > 16, then again perform value modulus 16
• Accepter sends the cipher text and the shared key
and store the positions where the value of mod
to the decryptor.
content > 16).
• Decryptor decrypts the encrypted message using
• Find the length of the plain text and save it in
the shared key (If the same key has not used the
length (variable).

2 Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology
 Narander Kumar and Priyanka Chaudhary

one used for encryption, the decryption then the • Decryptor sends the plain Message(i.e., decrypt
process is failing). by algorithm) to the Accepter.
• Decryptor creates the plain text that is send by All the above said steps are shown in the sequence
the sender. diagram to clarify all the process which includes two
encryption and decryption the data.

Figure 1. Flow chart of proposed encryption/decryption algorithm.

Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology 3
 Performance Evaluation of Encryption/Decryption Mechanisms to Enhance Data Security

Sender Encryption

+Text_data:String +Text_data:String

+send_data()() +encrypt_data()()

Decryption
Receiver

+Text_data:String
+Text_data:String

+decrypt_data()()
+get_data()()

Figure 2. Class diagram for encryption and decryption.

3. Implementation Minimum=97
Step 3: Perform modulus operation on each data
The algorithm and its GUI interface are developed using Modvalue[1] = 115 % 97 => 18
Java under Net Beans IDE 8.0. The message is sent into Modvalue[2] = 119 % 97 => 22
its corresponding ASCII value. The efficiency of the algo- Modvalue[3] = 97 % 97 => 0
rithms is defined in this section. All the results have been Modvalue[4] = 116 % 97 => 29
obtained using a computer with the following specifica- Modvalue[5] = 105 % 97 => 8
tions: Intel Core i3 CPU and 1GB RAM.
In this calculation two location find value more than
16 then again perform mod operation in these two loca-
4. Working Example
tions.
Now we input a text value is Swati. This is encrypted and
decrypted in following manner. Modvalue[1] = 18 % 16 => 2
Modvalue[1] = 22 % 16 => 6
4.1 Encryption Process Modvalue[1] = 29 % 16 => 13

Step 1: Input the plain text without space such as swati

Step 4: Generate key for encryption (key is generated
randomly by system)
Input s W a t i
Key A b c d e
ASCII Content 115 119 97 116 105
ASCII value 97 98 99 100 101
Step 2: Find minimum ASCII value Genarate random no. 4 2 3 5 1

4 Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology
 Narander Kumar and Priyanka Chaudhary

Figure 3. Sequence diagram for encrypting and decrypting a message through proposed
algorithm.

Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology 5
 Performance Evaluation of Encryption/Decryption Mechanisms to Enhance Data Security

Figure 4. Output screen for character input.

Store key value on the particular generated number Location[4] = 97 + 13 => 110
Location[5] = 100 + 8 => 108
Location[1] = 101
Location[2] = 98
Step 6: Find cipher text

Location[3] = 99
Final cipher value 103 104 99 110 108
Location[4] = 97
Cipher text g h c n l
Location[5] = 100
4.2 Decryption Process
Step 5: Add mod value and key value
Step 1:
Location[1] = 101 + 2 => 103
Location[2] = 98 + 6 => 104 Final cipher value 103 104 99 110 108

Location[3] = 99 + 0 => 99 Cipher text G h c n l

6 Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology
 Narander Kumar and Priyanka Chaudhary

Step 2: Minimum =97 shown in Figure 6. In this algorithm we use the randomly
Step 3: Add 16 on stored position where we perform generated a key value instead of shifting to the key value
again mod operation so the new differences value i.e., as described in to increase the level of security. In Figure
where mod operation >16) 7, shows the results that time is taken for the encryption
or decryption process by Proposed Algorithm are less
Location[1] = 103 16 => 119 than encryption or decryption time, which is compared
+
previous proposed an algorithm4. In Figure 8, shows
Location[1] = 104 16 => 110
+
the result of throughput of total execution (Encryption/
Location[1] = 110 +
16 => 126 Decryption) time of proposed Mechanism.

Step 4: Find plain text

6. Performance Factors
Cipher ASCII value 119 110 97 126 108 There are some performance parameters of proposed
ASCII final encrypt key 101 98 99 97 100
algorithm such as security level, key length and execution
Difference 8 12 2 28 7
time has considered evaluating the performance of the
Plain text ASCII value 115 119 99 125 105
proposed algorithm.
Plain text s w a t i Execution Time: In this proposed algorithm execu-
tion time (encryption/decryption) is less than previous
5. Efficiency Analysis algorithm which described in4.
More Secure: With the help of random number gen-
The Figures 1-8 are showing the performance during the eration of the key is more secure cipher text to provide
implementation of the proposed algorithm with a num- security.
ber of different data values of text and sizes of a wide Variable Key length: In this proposed algorithm vari-
range. The performance matrics are shown encoding and able key length is considered which improved level of
decoding time. The encryption time is defined as, the security and compared with the fixed length variable key
time is taken for generating a cipher text from plaintext mechanism.
and decryption time is defined as, the time taken for gen- Table 1 is defined the encryption and decryption
erating plain text form the cipher text. In Figure 4, author time for proposed algorithm and existing algorithm. The
used an input data of variable lengths with key of variable execution is defined as the time is taken for generating a
length for generating the cipher text and corresponding cipher text from plaintext and plain text form the cipher
execution time has been calculated. The proposed algo- text. Table 2 is defined the comparison between execution
rithm has taken time for encryption is shown in Figure 5. time for proposed algorithm and existing algorithm.
The proposed algorithm has taken time for decryption is

Figure 5. Time taken for encryption in proposed algorithm.

Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology 7
 Performance Evaluation of Encryption/Decryption Mechanisms to Enhance Data Security

Table 1. Encryption and decryption time of proposed Table 2. Execution Time of Proposed and Existing
algorithm Algorithm4
Previous
Encryption Proposed Algorithm
Encryption time Decryption time Plain Text Algorithm
Algorithm Execution time
(Microsecond) Microsecond) (Character) Execution time
( character) (Microsecond)
(Microsecond)
2 1000 1000 2 3220 2000
4 1270 1160 4 3679 2430
6 1430 1230 6 3861 2660
8 1740 1340 8 4748 3080
10 1958 1620 10 5543 3578

Figure 6. Time taken for decryption in proposed algorithm.

Figure 7. Encryption and decryption time comparison between existing algorithm5

and proposed algorithm.

8 Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology
 Narander Kumar and Priyanka Chaudhary

After find the Encryption and decryption times Table 3. throughput of proposed algorithm
checked there are also determine throughput that is dis-
cussed in13 how to calculate a through put of particular Plain Text
Execution
algorithm. (In Data
time Throughput
Where, terms of (Size in MB)
(Second)
character
Size of encrypted text in megabyte 2 .0009550 .002 .4775
Throughput =
Time required for encryption in second 4 .0009570 .00243 .3938
6 .0009609 .00266 .3612
After applying this formula in our proposed algo-
8 .0009648 .00308 .3132
rithm, we have found following result that is shown in
Table 3. 10 .0009667 .00358 .2700

Figure 8. Throughput of total execution (encryption/decryption)

time of proposed mechanism.

7 Conclusion
person gives the focal point on safety of records then they
The defined algorithm will gives the advance field of could use our designed technique. The primary benefit is
research on cryptography that is based symmetric that it’s far having variable length key technique to make
cryptography based on ASCII code value. These new it difficult for intruder to become aware of. So the element
algorithms for text encrypt and decrypt using ASCII code of security is high and the execution time is lesser as com-
value that is very efficacious methodology. This algorithm pared to above mentioned existing encryption systems.
is providing more security and reliability. The machine can be in addition prolonged to encrypt
the multimedia data including audio documents, video
documents and photos and so on. The principle pur-
8. Comparison and Future Scope pose of this proposed algorithm is protection. There are
From the results, we’ve evaluated that our proposed numerous destiny scope of ASCII fee based text statistics
encryption algorithm is furnished better conclusion as encryption and decryption. No unauthorized person can
compare to the prevailing set of rules so the time taken for hack the facts. In the current technology, new technolo-
encryption and decryption of our designed algorithm is gies had been upgraded time to time so there’s wanted to
lesser than existing algorithm. In the motive of safety our changes this algorithm. This algorithm may be similarly
algorithm boom safety and also time is reduced. If any progressed through a number of methods in future.

Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology 9
 Performance Evaluation of Encryption/Decryption Mechanisms to Enhance Data Security

9. References 8. Parthasarathy MB, Srinivasan B. Increased security in

image cryptography using wavelet transforms. Indian
1. Smith RE. Elementory Information Security. Barlington: Journal of Science and Technology. 2015 Jun; 8(12):1–8.
Jones and Bartlett Learning; 2013. 9. George DIA, Geetha JS, Mani K. Analysis and enhancement
2. Elena A. A novel text encryption algorithm. Research in of speed in public key cryptography using message encod-
Computing Science. 2013; 68:99–101. ing algorithm. Indian Journal of Science and Technology.
3. Ranjan B. Information theory, coding and cryptography. 2015 Jul; 8(16):1–7.
New Delhi: Tata-McGraw Hill; 2008. 10. Thasneem PTS, Vigneswaran. FPGA implementation of
4. Akansha M. An ASCII value based data encryption algo- hiding information using cryptography. Indian Journal of
rithm and its comparison with other symmetric data Science and Technology. 2015; 8(18):1–6.
encryption algorithms. International Journal on Computer 11. Regina TSR, Britto S, Ramesh K. Enhanced elliptic curve
Science and Engineering. 2012; 4(9):1650–6. cryptography. Indian Journal of Science and Technology.
5. Vincent PMDR. Iqbal SA, Bhagat K, Kushwaha KK. 2015; 8(26):1–6.
Cryptography: A mathematical approach. Indian Journal of 12. Monisha S, Kowar MK. Generation of quasigroup for
Science and Technology. 2013; 6(12):5607–11. cryptographic application. Indian Journal of Science and
6. Swapna BS, Emeritus NS. A survey on cryptography Technology. 2009; 2(11):35–6.
using optimization algorithms in WSNs. Indian Journal of 13. Nidhal AKEl. Text encryption based on singular value
Science and Technology. 2015; 8(3):216–21. decomposition. European Academic Research. 2014;
7. Jorge EC, Diego FS, Yeison FT. Study of cryptographic 2(4):4631–42.
algorithms to protect electronic medical records in mobile
platforms. Indian Journal of Science and Technology. 2015;
8(21):1–7.

10 Vol 9 (20) | May 2016 | www.indjst.org Indian Journal of Science and Technology