Modern Encryption Algorithm Version-1(MEA-1) - IJETAE

International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 6, Issue 1, January 2016)

Modern Encryption Algorithm Version-1(MEA-1) Asoke Nath1, Subrata Modak2, Sougata Mandal3 1,2,3

Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India Nath et al already developed several cryptographic methods such as MSA, DJSA, TTJSA, Bit Level Encryption Standard, Modern Encryption Standard, Ultra Encryption standard, Multi way feedback encryption standard, 2 dimensional multi way feedback encryption standard, 3-dimensional multi way feedback encryption standard. Recently Nath et al developed some bit level encryption algorithms which are not only more complex than standard cryptography algorithms but also the methods are very safe because the hackers will not be able to decrypt the cipher text without knowing the key and also the exact method. In the present method the authors have introduced completely new way to encrypt data. The entire plain text is searched for calculating frequency of each character. The highest frequency character is given a smallest bit pattern. The plain text is mapped to new bit pattern. Finally each 8 bits are converted to byes and then transferred to some output file. The key contains the entire mechanism. So therefore, the key is to be kept secret. The present method is very much dependent on key generated after completion of encryption process. Without having key no one can decrypt the encrypted message. The standard cryptographic attacks such as known plain text attack, brute force attack, differential attack is not possible. The method applied on several common plaintext and the results coming are totally unpredictable. This method may be applied multiple times and can make the whole system totally unbreakable. The proposed method may be applied in smartphone/mobile phone data encryption. The present method may be applied to encrypt One Time Pass word(OTP), in android mobile this method may be used to encrypt any kind of data.

Abstract— The last one decade many challenging encryption algorithms have been developed by many researchers across the globe. The researchers are trying to develop encryption algorithms in small devices like smart phone, mobile phone or in electronic devices used in Internet of Things(IoT). Recently strong bit level encryption algorithms proposed by Nath and his research groups(2014,2015). In the present paper the authors have introduced a new algorithm to encrypt data using a modified Huffman encoding method. In this paper the authors have introduced a new encryption algorithm where they have represented maximum occurrence of a particular character by minimum number of bits. This method may be used to compress a data file as well. Keywords— confidential data, encryption, frequency, Huffman encoding, OTP.

I. INTRODUCTION Due to tremendous expansion and growth in internet technologies both in hardware and software now it is a great challenge to send or to receive any kind of confidential data from one computer to another computer. The topic ―Data security‖ is now a very important issue in data communication and network. When there was no internet then the data were kept in manual registers or files and that is why data were fully secured because the data were not available in internet. But now-a-days almost all data are available in internet and hence those who are hackers they can intercept those data and can do any kind of disasters also. Moreover, the hackers also try to extract important personal data from any social networks and can initiate any kind of disasters. It is not recommended to send any kind of confidential data in non encrypted form. The last 2 decades the subject called cryptography is a very important and relevant to protect data from any kind of intruders. Cryptography is the subject which deals with how one can modify a readable text or document or any object to unreadable text or documents or some other objects. There are some standard cryptography algorithms such as Data Encryption Standard (DES), Advanced Encryption Standard (AES), Rivest Shamir Addlemen (RSA), Elliptic Curve Cryptography (ECC) any many more. There are quite a number of researchers who have modified or developed some revised or new methods also.

II. BASIC CONCEPT BEHIND THE ALGORITHM The algorithm proposed here is basically a substitution cipher technique where a systematic method is followed to find out the substitutes for each character in the plaintext. It is achieved by exploiting the concept of Huffman tree. This method is very similar to classical form of mono-alphabetic cipher techniques where each character in the plaintext is substituted by a single character only. Here instead of using one character as a substitute, a set of bits is used.

256

International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 6, Issue 1, January 2016) Let us see exactly how this algorithm works. Consider a plaintext having “ethesis” as its contents. The frequencies of characters here are listed below:

Fig. 1 represents the tree corresponding to the example taken here. The path from every leaf node to root node gives the corresponding character‘s binary value. These values are:

f(e) =2

e=0

f(t) =1

s = 01

f(h) =1

t = 011

f(s) =2

h = 0111

f(i) =1

i = 01111

Now these characters are sorted in descending order based on their frequencies, which gives the sorted list f(e), f(s), f(t), f(h), f(i). Now a tree is formed which is very similar to Huffman tree. The root holds the total number of characters in the plaintext. The left child holds the value corresponding to highest frequency among all the characters in the plaintext. The right child holds the value obtained by subtracting left child from the root. In the next step, the right child is considered as the root and the whole process is repeated again and again until the value to be assigned to the right child becomes zero.

All these characters in the plaintext are substituted with their corresponding binary values. ―ethesis‖ : 0 011 0111 0 01 01111 01 e

t

h

e

s

I

s

We use every 8-bit segment to generate ASCII values. ―ethesis‖ : 00110111 00101111 01 8-bit

8-bit

extra bit

Bit padding is needed to complete 8-bit segmentation. ―ethesis‖ : 00110111 00101111 01

100000

―ethesis‖ : 00110111 00101111 0110000

55

47

96

7

/

`

Encrypted message: 7/` Key: 1esthi First character of key file is used to know whether bit padding has been applied or not. Second to last characters are the unique characters of the plaintext file. For decryption the encrypted message is converted into binary. 7/` : 00110111 00101111 01100000 Fig. 1: Modified form of Huffman Tree

Since first character of key filed is 1, bit pad has to be removed.

The edge to the left child of any node is labeled ‗0‘ and that to the right child of any node is labeled ‗1‘. The path starting from any leaf node to the root node represents the bit-stream for that particular character and that bit-stream will be used as the substitute for that character in the ciphertext.

00110111 00101111 0110000 Bit pad

257

International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 6, Issue 1, January 2016) Encrypted text excluding bit pad: 00110111 00101111

A. Initialize root=nc B. For every element c[i] i) Insert (c[i],f[i]) to the left of the root and level the child as ‗0‘ ii) nc=nc-f[i] and assign it to the right of the root. Level the child as ‗1‘ iii) root=root->right child. Repeat step B. Step 6: Now a binary value is got for every unique character from the tree. The path from root to every leaf node gives the corresponding character‘s binary value Step 7: Replace all the characters in the source file with their corresponding binary values. Step 8: Every 8-bit segment in the modified file is converted to decimal which ranges within 0-255. Considering these values as ASCII, their equivalent characters are stored in a file which forms the encrypted file. Step 9: If less than 8 bits are left, bits are padded to make them 8. Bit padding is done in the following ways: a) n =8 - remaining bits. b) Concatenate ‗1‘ and (n-1) ‗0‘s with the remaining bits c) Make bit_pad=1 d) Convert the bit segment to its equivalent binary and append it in the binary file Key: ―bit_pad, Unique characters”

01 To extract the plaintext characters from the binary values, the encrypted text is scanned from the endpoint to the beginning.

0 011 0111 0 01 01111 01 Then these unique binary codes are sorted in ascending order of their lengths. 0 01 011 0111 01111 The length of each code corresponds to the position of that particular character in the key file (starting from the second position, excluding the bit pad marker flag). 0=e 01 = s 011 = t 0111 = h 01111 = i

B. Decryption Algorithm Step 1: Initialize bin[]=0 Step 2: Extract all the characters except the ‗bit_pad‘ in key file and keep them in an array called key[]. Step 3: Convert the encrypted message file into binary code. Step 4: Inspect key file. If bit_pad=1, remove all the bits from the end of the file until a ‗1‘ is removed. Step 5: Binary code separation: Scan the binary code from the end of the file. The code for a character is found when it encounters a 0. A code is stored in bin[] only if it is a new encounter. Step 6: Sort bin[] in ascending order based on the lengths of the codes. Now bin[i] represents the code for key[i]. Step 7: Now scan the binary code again obtained in step-4 and replace a code with key[i] if it matches with bin[i].

0 011 0111 0 01 01111 01 e

t

h

e

s

i

s

Finally the ciphertext has been decrypted. III. THE ALGORITHM A. Encryption Algorithm Step 1: Initialize bit_pad=0, nc=total number of characters in the file to be encrypted Step 2: Read every unique character from the data file and store them in c[]. Step 3: Calculate the frequencies of elements in c[] in the data file and store them in an array called f[]. Step 4: Sort c[] in descending order based on their frequencies. Step 5: Now create a tree using the following steps:

258

International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 6, Issue 1, January 2016) The text file obtained after this step is the original plaintext.

key: 1A 7.

C. Experimental Results 1. Plaintext: 111111111...256

Encrypted text: ^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

Encrypted text: ^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

key: 1B 8.

key: 11 2.

Plaintext: 2222222....256

^@^@^@

^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

key: 1A

key: 12

9.

Plaintext: ABCDEFGHIJKLMNOPQRSTUVWXYZ

Plaintext: 33333333...256

Encrypted text: Þû÷÷ûþÿßýÿïÿ¿ÿ^?ÿ^?ÿ¿ÿïÿýÿÿßÿþÿÿûÿÿ÷ÿÿ÷ÿÿûÿÿÿ

Encrypted text: ^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

4.

key: 1ABCDEFGHIJKLMNOPQRSTUVWXYZ 10. Plaintext: 11111111

key: 13

Encrypted text:

Plaintext: 44444444.....256

^@

Encrypted text:

key: 01

^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

5.

11. Plaintext: aaaaaaaa Encrypted text:

key: 14

^@

555555......256

key: 0a 12. Plaintext: HE IS GOOD

Encrypted text:

Encrypted text:

^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

n{çêÿ key: 1 OHEISGD

key: 15 6.

Plaintext: AAAAAAAAAAAAAAAAAAAAAAAAAA Encrypted text:

Encrypted text:

3.

Plaintext: BBBBBBBBB......256

13. Plaintext: HE IS GOON

Plaintext: AAAAAAAA.....256

Encrypted text:

Encrypted text:

n{çêÿ

^@^@^@^@^@^@^@^@^@^@^@^@^@^@^ @^@^@^@^@^@^@^@^@^@^@^@^@^@^@ ^@^@^B

key: 1 OHEISGN

259

International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 6, Issue 1, January 2016) [4]

14. Plaintext: HE IS GOOF Encrypted text: n{çêÿ

[5]

key: 1 OHEISGF 15. Plaintext: ababababa

[6]

Encrypted text: $ key: 1ab 16. Plaintext: madam

[7]

Encrypted text: -@ key: 1mad

[8]

IV. CONCLUSION AND FUTURE SCOPE The present method is very much sensitive on key. The key should be kept secret. The key contains the distinct alphabets which are there in plain text. The key to be encrypted with some public key method and to be sent to receiver. The entire method is unbreakable provided the key is not known. The output shows that different plain texts may create same encrypted text which is the strength of this present method. This method may be useful to encrypt small message, confidential message such as password, one time password, any kind of key etc. There is scope to upgrade this method to make the algorithm more complex. The authors are presently working to upgrade the present method to make the method more complex.

[9]

[10]

[11]

REFERENCES [1]

[2]

[3]

Symmetric Key Cryptography using Random Key generator: AsokeNath, SaimaGhosh, MeheboobAlamMallik: ―Proceedings of International conference on security and management (SAM‘10‖ held at Las Vegas, USA Jull 12-15, 2010), Vol-2, Page: 239244(2010). A new Symmetric key Cryptography Algorithm using extended MSA method: DJSA symmetric key algorithm, DriptoChatterjee, JoyshreeNath, SuvadeepDasgupta and AsokeNath : Proceedings of IEEE International Conference on Communication Systems and Network Technologies, held at SMVDU(Jammu) 03-06 June,2011, Page-89-94(2011). New Symmetric key Cryptographic algorithm using combined bit manipulation and MSA encryption algorithm: NJJSAA symmetric key algorithm:NeerajKhanna, Joel James,JoyshreeNath, SayantanChakraborty, AmlanChakrabarti and AsokeNath : Proceedings of IEEE CSNT-2011 held at SMVDU(Jammu) 03-06 June 2011, Page 125-130(2011).

[12]

[13]

[14]

[15]

260

Symmetric key Cryptography using modified DJSSA symmetric key algorithm, DriptoChatterjee, JoyshreeNath, Sankar Das, ShalabhAgarwal and AsokeNath, Proceedings of International conference Worldcomp 2011 held at LasVegas 18-21 July 2011, Page-306-311, Vol-1(2011). Symmetric key Cryptography using two-way updated – Generalized Vernam Cipher method: TTSJA algorithm, International Journal of Computer Applications (IJCA, USA), Vol 42, No.1, March, Pg: 34 -39( 2012). Ultra Encryption Standard(UES) Version-I: Symmetric Key Cryptosystem using generalized modified Vernam Cipher method, Permutation method and Columnar Transposition method, Satyaki Roy, NavajitMaitra, JoyshreeNath,ShalabhAgarwal and AsokeNath, Proceedings of IEEE sponsored National Conference on Recent Advances in Communication, Control and Computing TechnologyRACCCT 2012, 29-30 March held at Surat, Page 81-88(2012) Advanced Digital Steganography using Encrypted Secret Message and Encrypted Embedded Cover File, JoyshreeNath, SaimaGhosh and AsokeNath, International Journal of Computer Applications (IJCA 0975-8887), Vol 46, No-14, May ,(2012). Ultra Encryption Standard(UES) Version-II: Symmetric key Cryptosystem using generalized modified vernam cipher method, permutation method, colum,nar transposition method and TTJSA method, Satyaki Roy, NavajitMoitra, JoyshreeNath, ShalabhAgarwal and AsokeNath, Proceedings of International Conference Worldcomp 2012 held at Las Vegas, USA, FCS-12, Page-97 – 104(2012). Ultra Encryption Standard(UES) Version-IV: New Symmetric Key Cryptosystem with bit-level columnar Transposition and Reshuffling of Bits, Satyaki Roy, NavajitMaitra, JoyshreeNath, ShalabhAgarwal and AsokeNath, International Journal of Computer Applications(IJCA)(0975-8887) USA Volume 51-No.1.,Aug, Page. 28-35(2012). Bit Level Encryption Standard (BLES) : Version-I, NeerajKhanna,DriptoChatterjee, JoyshreeNath and AsokeNath, International Journal of Computer Applications(IJCA)(0975-8887) USA Volume 52-No.2.,Aug, Page.41-46(2012). Bit Level Encryption Standard(BLES) : Versiob-II, GauravBhadra, Tanya Bala, SamaikBanik, JoyshreeNath and AsokeNath, Proceedings of IEEE International Conference WICT-2012 held at IIITM-K, Trivandrum Oct 30 to Nov 1, 2012, Page No. 121127(2012). Modern Encryption Standard(MES) version-I : An Advanced Cryptographic Method, SomdipDey, AsokeNath, Proceedings of IEEE International Conference WICT- 2012 held at IIITM-K, Trivandrum Oct 30 to Nov 1, 2012, Page No. 242-247(2012). Bit Level Generalized Modified Vernam Cipher Method with Feedback, International Journal of Advanced Computer Research (ISSN(print):2249- 7277 ISSN(online): 2277-7970), Volume-2, Number-4 Issue-6, Page-24-30, Dec(2012). Bit Level Encryption Standard (BLES): Ver-III, GauravBhadra, Tanya Bala, SamikBanik, JoyshreeNath, AsokeNath, Proceedings of International Conference Worldcomp 2013 held at Las Vegas, USA in Jul 22-25, 2013. Proceedings page 99-105(2013). Advanced Symmetric Key Cryptosystem using Bit and Byte Level Encryption Methods with Feedback‖ dvanced Symmetric Key Cryptosystem using Bit and Byte Level Encryption methods with Feedback, Prabal Banerjee, AsokeNath, Proceedings of InInternational Conference Worldcomp 2013 held at Las Vegas, USA in Jul 22-25, 2013.Proceedings Page 120-126(2013).

International Journal of Emerging Technology and Advanced Engineering Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 6, Issue 1, January 2016) [16] Multi Way Feedback Encryption Standard Ver-3(MWFES-3), AsokeNath, DebdeepBasu, Ankita Bose, SaptarshiChatterjee, SurajitBhowmikpublished in IEEE conference proceedings: WICT2013 held at Hanoi in Dec 14-18(2013), page 318-325(2013). [17] Multi Way Feedback Encryption Standard Ver-2(MWFES-2), AsokeNath, DebdeepBasu, Ankita Bose, SaptarshiChatterjee, SurojitBhowmik , International Journal of Advanced Computer Research(IJACR), Vol 3, Number-1, Issue-13, Page-29-35, Dec(2013). [18] AnkitaBasu, DebdeepBasu, SaptarshiChatterjee, AsokeNath, SurajitBhowmik, Bit Level Multi Way Feedback Encryption Standard Ver- 1(BLMWFES-1), published in Proceedings of IEEE conference CSNT-2014 held at Bhopal, page-601-605, April 7(2014).page-793-799, April 7(2014). [19] AsokeNath , Bit level Multi Way Feedback Encryption Standard Ver- 2(BLMWFES-2) , proceedings of International IEEE conference Advanced Communication, Control & Computing Technologies(ICACCCT) 2014 held at Syed Ammal Engineering College, Page 1702- 1707(2014).

[20] ArijitGhosh, PrabhakarChakraborty, AsokeNath, ShamindraParui, 3d Multi Way Feedback Encryption Standard Version-I (3dMWFES1)‖,International Journal of Advance Research in Computer Science and Management Studies, ISSN:23217782(Online), Vol 2, Issue 10,Oct, Page:206-218(2014). [21] ArijitGhosh, PrabhakarChakraborty, AsokeNath, ―3d Multi Way Feedback Encryption Standard Version II(3dMWFES-II)‖, International Journal of Computer Science and Information Technologies(IJCSIT), Vol.6(3), Page 2990-2997(June 2015). [22] AsokeNath, Ranjini Mukherjee, Dona Sarkar, ChaitaliPatra, ―2Dimensional Multi Way Feedback Encryption Standard Version1(2dMWFES-1)‖, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE), Vol-3, Issue 6, Page 5024-5033(30-th June 2015).

261