Data Security Using Triple Encryption
Satish Kumar Garg
Govt. P G College Ambala Cantt. - 133001
*Corresponding Author Email: sat.phy@gmail.com
ABSTRACT:
In the present work the author has suggested a unique cryptographic method where by using transposition and rotation ciphers, triple encryption (E3) is achieved. In this method, E3 is achieved by first applying the transposition cipher on the plain text and then applying rotation cipher on this transposed text. The proposed method can be applied to encrypt any data consisting of 30 or more characters. The results obtained after application of proposed algorithm are excellent and difficult to decrypt.
KEYWORDS: Encryption, Decryption, Transposition Cipher, Rotation Cipher.
I.INTRODUCTION :
In today’s global scenario, the internet technology [1,2] is used almost in every field, specially for transmission of information. So it has become a real challenge for the sender to send confidential data from one computer to another computer. The security and originality of data [1] has now become very challenging because there is always a possibility that anyone may intercept our data. It is not safe to send confidential data from one computer to another computer. The confidential data may be bank statements, bank transaction, military information, confidential data of companies etc. So, the data should be protected from any unwanted intruder otherwise any massive disaster may happen all on a sudden. In order to make secure the system one should consider the security primary attributes such as confidentiality, integrity, availability etc. and secondary attributes such as authenticity, non-repudiation, accountability etc. There are a large number of methods and techniques to achieve security goals, one of these is Cryptography. Cryptography [3,4] is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. Cryptography is not the only means of providing information security, but rather one set of techniques. The cryptographic algorithm can be classified into two categories: (i) Symmetric Key Cryptography where one key is used for both encryption and decryption purpose. (ii) Public Key Cryptography where two different keys are used, one for encryption and the other for decryption purpose. Due to massive computation the public key crypto system may not be suitable in security of data in sensor networks [5]. The author has developed an algorithm named as algorithm SKG 1.0 which is successful for encrypting any text/string consisting of 30 or more characters [6].
In the present work the author suggested a unique cryptographic method where by using transposition and rotation ciphers, triple encryption (E3) is achieved. In this method, E3 is achieved by first applying the transposition cipher on the plain text and then applying rotation cipher on this transposed text.
II. THEORY :
We know that N characters can be re-arranged in N! ways. In the present work, the author has selected one such re-arrangement of N characters in two stages :
|
Stage 1 : |
By transposing/swapping integral multiples of leftmost N1st character with integral multiples of rightmost N1st character, such that if (N+1) is divisible by N1, swapping should be implemented upto N/2 characters otherwise upto Nth character. |
|
Stage 2 : |
By rotating/shifting N2 leftmost characters to rightmost in circular queue or vice versa |
III. PROPOSED ENCRYPTION ALGORITHM
1. Read the input string of characters and Check the number of characters, N
2. If N<30, then write PROGRAM IS NOT APPLICABLE
3. If (N+1)/N1 = 0, Transpose Integral Multiples of LMC with corresponding RMC upto middle of the string otherwise proceed upto N
4. Rotate the characters in circular queue towards Left/Right by N2 places
5. Output is Encrypted String
IV. SCHEMATIC DIAGRAM FOR PROPOSED ALGORITHM
Plain Text Cipher Text
V. PSEUDO CODE FOR PROPOSED ENCRYPTION ALGORITHM
// Read the input string of characters and Check the number of characters N, if N is less than 30, give error message
Step 1: Start
Step 2: Read input N
Step 3: If (N.length()< 30)
Print error message ‘PROGRAM IS NOT APPLICABLE’;
// Transpose the integral multiples of leftmost N1 characters with corresponding rightmost N1 characters
Step 4: initialize l = length of string // length of string is N, this will be
used at number of places in program
Step 5: initialize integer j (to store length to be traversed [loop through])
Step 6: Read value of N1
Step 7: integer r = remainder of (N+1)modulus N1
Step 8: if (r==0)
j = l/2;
else
j = l;
Step 9: for(i=1;N1*i<=j;i++)
{
ch = charAt(N1*i-1);
Replace/ set charAt((N1*i)–1)th position with charAt((l+1)-
(N1*i))th position;
Replace/ set charAt((l+1)-(N1*i))th position with char stored in
variable ‘ch’;
}
// Rotate leftmost N2 characters to rightmost of the string of characters in circular queue and vice versa
Step 10: Read value of N2 and Direction of Rotation (Left/Right)
Step 11: initialize array a1[l]//of length N
Step 12: If Rotating rightmost characters to leftmost, then go to step 14
Step 13: If Rotating leftmost characters to rightmost
for each character starting from N2+1 to end of N characters
copy each character to array a1
for each character starting from 1st character upto N2
copy(append) each character to a1
Step 14: for each character starting from (N+1-N2) to N characters
copy each character to array a1
for each character starting from 1st character to (N-N2)
characters
copy (append) each character to a1
Step 15: print and return string to output file
The decryption algorithm is just the reverse of the encryption algorithm
VI. IMPLEMENTATION OF PROPOSED ALGORITHM :
The proposed algorithm is successful for encrypting any plain text consisting of 30 or more characters. Any plain text consisting of 30 characters will on the average contain 6 or more different characters, so minimum number of possible re-arrangements shall be 30!/(5!)6 = 8.88×1019. The available Super Computer is teraflop computer which is capable of performing 1012 floating point calculations per sec, so to perform all 8.88×1019 calculations, time required is 1028 days, which is sufficiently large to decrypt any text [6].
We have implemented the proposed algorithm on Java platform for different values of N1 = 1 to N/6 and N2 = 1 to (N-1). For example for the plain text :
Ambala Cantt is situated on the North-Eastern edge of Haryana. It is known as City of Scientific Instruments on International level. It is gate way to Chandigarh, Panjab, Himachal Pradesh and Jammu & Kashmir
Cipher text is shown in Table 1 for different values of the keys (N1,N2 and direction of rotation).
Table 1 : Cipher Text for different values of keys for the same Plain Text
|
S. No. |
Keys (N1, N2 Direction) |
Cipher Text |
|
1. |
1, 3, Left |
hsaK & ummaJ dna hsedarP lahcamiH ,bajnaP ,hragidnahC ot yaw etag si tI .level lanoitanretnI no stnemurtsnI cifitneicS fo ytiC sa nwonk si tI .anayraH fo egde nretsaE-htroN eht no detautis si ttnaC alabmArim |
|
2. |
1, 3, Right |
bmArimhsaK & ummaJ dna hsedarP lahcamiH ,bajnaP ,hragidnahC ot yaw etag si tI .level lanoitanretnI no stnemurtsnI cifitneicS fo ytiC sa nwonk si tI .anayraH fo egde nretsaE-htroN eht no detautis si ttnaC ala |
|
3. |
2, 3, Left |
hla a tm as snt ased rn taecNmrHh,EasnePn,ergg dfaHCroa aa ttig sn wI .seCet afoStinneini onstnumerts IncIfttreaci nolyliv la ntoik sa eIw.ynty ah noieadh ratjab- tioa hhl Poadethuaid Jimtun&CKasammrAib |
|
4. |
2, 3, Right |
mmrAibhla a tm as snt ased rn taecNmrHh,EasnePn,ergg dfaHCroa aa ttig sn wI .seCet afoStinneini onstnumerts IncIfttreaci nolyliv la ntoik sa eIw.ynty ah noieadh ratjab- tioa hhl Poadethuaid Jimtun&CKasa |
|
5. |
2, 5, Left |
a a tm as snt ased rn taecNmrHh,EasnePn,ergg dfaHCroa aa ttig sn wI .seCet afoStinneini onstnumerts IncIfttreaci nolyliv la ntoik sa eIw.ynty ah noieadh ratjab- tioa hhl Poadethuaid Jimtun&CKasammrAibhl |
|
6. |
2, 5, Right |
sammrAibhla a tm as snt ased rn taecNmrHh,EasnePn,ergg dfaHCroa aa ttig sn wI .seCet afoStinneini onstnumerts IncIfttreaci nolyliv la ntoik sa eIw.ynty ah noieadh ratjab- tioa hhl Poadethuaid Jimtun&CKa |
VII. RESULTS AND DISCUSSION :
We have implemented the proposed algorithm on Java platform for different values of N1(= 1 to N/6), N2 (= 1 to (N-1)) and left /right directions of rotation of the characters. From Table 1, it is clear that if we change even a single key (N1, N2 or direction of rotation of the characters either to Left or Right) then output of the proposed algorithm is entirely different.
VIII. CONCLUSION:
The proposed algorithm was tested on Java platform for different values of N (=30 to 1000) each for different values of N1= 1 to N/6, N2 = 1 to (N-1) and left /right directions of rotation of the characters. In all cases the result came as per the literature. It has been estimated that to crack the code we will require more time than the data will reside on the medium to travel. So, it can be said that the proposed scheme will produce an efficient secured algorithm for data transfer in both wired and wireless networks.
IX. REFERENCES:
1. S. K. Garg, Review of Secured Routing for Wireless Ad hoc Network, International Journal of Computing and Business Research, Vol. 2 (1), 2011.
2. S. K. Garg, Wireless Network Security Threats, International Journal of Information Dissemination and Technology, Vol. 1 (1), 2011.
3. T. Karygiannis and L. Owens, Wireless Network Security, NIST Special Publication, 2002
4. William Stallings, Cryptography and Network Security: Principles and Practice, Prentice Hall, 5th Edition, 2011.
5. R. H. Karpinski, Reply to Hoffman and Shaw, Datamation, Vol. 16(10) p. 11 (Oct. 1970)
6. S. K. Garg, Information Security By Interchanging Characters: Algorithm SKG 1.0, International Journal of Information Technology and Knowledge Management, Vol. 6 (2), 2013.
|
Received on 26.08.2016 Accepted on 11.09.2016 © EnggResearch.net All Right Reserved Int. J. Tech. 2016; 6(2):206-208. DOI: 10.5958/2231-3915.2016.00031.6 |
|