IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 2, Issue 1, January 2014

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

A SYMMETRIC KEY CRYPTOGRAPHIC ALGORITHM

Soubhik Kumar Dey1, Mr. Tarak Nandy2
1

M.Tech fellow, Department of CSE, Narula Institute of Technology, Agarpara, West Bengal, INDIA

Assistant professor, Department of CSE, Narula Institute of Technology, Agarpara, West Bengal, INDIA

ABSTRACT
A set of people who use a common language to communicate between them, any message said in that language by them will be called plain text as everyone from that set can easily understand that message. But sometimes it is necessary to hide that message from some people of that set. Only the sender and authorised receiver can decrypt it. So, sender codifies the message and sends it to authorised receiver. The coded message is called cipher text. This conversion of plain text to cipher text is cryptography. By doing this we can protect information from unauthorized access. Nowadays for password of online account, ATM cards, message transfer during wars cryptography is widely used. Cryptography is done by using sometimes symmetric key algorithm or sometimes asymmetric key algorithms. This paper describes cryptography, briefly about symmetric key algorithms and then proposes a new symmetric key algorithm for both encryption and decryption technique. The advantages of this new algorithm over the others are also explained.

KEYWORDS: Cryptography, Symmetric key, Asymmetric key.

1. INTRODUCTION
During the evaluation of mankind it is seen that communication system is one of the most valuable parts of civilization. So, information security is also very important. That is why cryptography is part of this world almost 4000 years or more. Before invention of computers cryptography was done by using mathematics. But after invention of computers specially after increasing its use cryptography is one of the most essential and discussed part of computer science. Today everywhere like banking sectors, Govt. or ordinary mailing system, online information sharing, money exchange, military communication, intelligence where information is the most valuable thing cryptography comes to play. The art of devising ciphers from plain text using logic is called cryptography. The art of decrypt those ciphers are called cryptanalysis. Together Cryptography and Cryptanalysis is called cryptology. Using different mathematical logic we encrypt a message. A set of these logics are called Cryptographic algorithm. These algorithms function using a key. So, depending on key cryptography can be classified in two basic categories Symmetric Key and Asymmetric Key cryptography. In case of symmetric key algorithms we use a single key for both encryption and decryption purpose. Some of these symmetric key algorithms are DES, AES and IDEA etc. For asymmetric key cryptography we use one key for encryption purpose and one key for decryption. Some of these asymmetric key algorithms are RSA, DSA and Diffie-Hellman etc. In both cases the most important thing is secure the plaintext. So, security of plaintext directly depends on strength of the used cryptographic algorithm and the key. Stronger the algorithm and more secure the key means harder to break the cipher by an unauthorized person.

2. A NEW SYMMETRIC KEY ALGORITHM

Section 2.1 describes the encryption process. And section 2.2 defines the decryption process 2.1. ENCRYPTION ALGORITHM Step 1: Take any letter for encryption and generate the ASCII value for the letter. Step 2: Generate the binary value of that ASCII value and call it element. [Binary number should be of 8 bit.] Step 3: Inverse the odd position bits of the 8 bit element.

Volume 2 Issue 1 January 2014

Page 33

IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 2, Issue 1, January 2014

th

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

Step 4: Interchange every two consecutive position bits of the element. [Interchange between 1st and 2nd, 3rd and 4th , 5 and 6th, 7th and 8th position bits.] Step 5: Consider the first four digits as sub-element-1 and last four digits as sub-element-2. Step 6: Take a 3 digit binary number (100) as divisor and consider it as Key. Step 7: Divide the sub-element-1 by the key and get the quotient-1, remainder-1 and divide the sub-element-2 by the key and get the quotient-2, remainder-2. All of them should be 2 digit binary numbers. Step 8: Merge the quotient-1, remainder-1, quotient-2, and remainder-2 in the following order quotient-1, remainder-2, quotient-2, and remainder-1 to get the 8 bit cipher text. 2.2. DECRYPTION ALGORITHM Step 1: Take the cipher text mark (right to left) first-second digit as quotient-1, third-fourth digit as remainder-2, fifth-sixth digit as quotient-2 and seventh-eighth digit as remainder-1. Step 2: Multiply the quotient-1 with the key and then add the result with remainder-1 to get the result which we can call as sub-element-1. Similarly multiply the quotient-2 with the key and then add the result with remainder-2 to get the result which we can call as sub-element-2. Step 3: Merge sub-element-1 and sub-element-2 in the following order sub-element-1 and sub-element-2 to get the result we call element. Step 4: Interchange every two consecutive position bits of the element. [Interchange between 1st and 2nd, 3rd and 4th , 5 and 6th, 7th and 8th position bits.]
th

Step 5: Inverse the odd position bits of the 8 bit element. And this will be our plain text which was encrypted.

3. EXAMPLE
Section 3.1 describes the example encryption process. And section 3.2 defines the example decryption process 3.1. ENCRYPTION Step 1: Take a letter M for encryption and its ASCII value is 77. Step 2: Binary value of 77 is 01001101(it should be 8 bit so first 0 is added) 0 1 0 0 1 1 0 1

Element Step 3: Inversing the odd position bits of the element we get 0 0 0 1 1 0

Element Step 4: Interchanging every two consecutive position bits of the element we get 0 0 1 0 0 1 0 0

Element Step 5: Defining sub-element-1 and sub-element-2. 0 0 1 0 0 1 0 0

Sub-element1

Sub-element2

Volume 2 Issue 1 January 2014

Page 34

IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 2, Issue 1, January 2014

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

Step 6: Let the key is 100. Step 7: After divide the sub-element-1 and sub-element-2 by the key we get 0 0 Quotient-1 0 1 Quotient-2

Remainder-1 0 0 Remainder-2

Step 8: Arranging quotient-1, remainder-1, quotient-2 and remainder-2 as per the algorithm we get 0 0 0 0 0 1 1 0 Cipher text 3.2. DECRYPTION Step 1: Define quotient-1, remainder-1, quotient-2, remainder-2 from the cipher text as per decryption algorithm. 0 0 0 0 0 1 1 0 Cipher text 0 0 0 0

Quotient-1 0 1

Remainder-2 1 0

Quotient-2 Remainder-1 Step 2: (quotient-1 * Key)+remainder-1= sub-element-1; (quotient-2 * Key) + remainder-2= sub-element-2. 0 0 1 0 0 1 0 0 Sub-element-1 sub-element-2 Step 3: Merging sub-elements 0 0

Element Step 4: Interchanging every two consecutive position bits of the element we get 0 0 0 1 1 0 0 0 Element Step 5: Inversing the odd position bits of the element we get the plain text we encrypted. 0 1 0 0 1 1 0 1 Plain text

4. ADVANTAGES OF THIS NEW ALGORITHM

This is a very simple algorithm to implement. This algorithm can be modified by changing the length of key and with minor change on the other steps of the algorithm. This is a very secure algorithm as lots of operations are done in the steps. This algorithm is very much helpful for small amount of data.

5. CONCLUSION
This algorithm follows a simple technique to encrypt the plain text by modifying the data by inversing, interchanging and by taking the division operation as a prime encryption policy. Being simple this algorithm is easy to use for encryption and decryption. Security is a major parameter for cryptography. And the cipher generated by this algorithm is not easy to decrypt. If the key is known by anyone then also it is not easy to decrypt the cipher text.

Volume 2 Issue 1 January 2014

Page 35

IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 2, Issue 1, January 2014 REFERENCES

[1] [2] [3] [4] [5] [6]

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

John C. Bowman, Math 422 Coding Theory & Cryptography, University of Alberta, Edmonton, Canada. David A. Santos, Linear Algebra Notes, January 2, 2010 Revision, dsantos@ccp.edu. Koblitz, N. A Course in Number Theory and Cryptography, 2nd ed. New York: Springer-Verlag, 1994. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996 Mark Adler and Jean-Loup Gailly,An Introduction to Cryptography, released June 8, 2004. www.pgp.com. Prakash Kuppuswamy, Dr.C.Chandrasekar, ENRICHMENT OF SECURITY THROUGH CRYPTOGRAPHIC PUBLIC KEY Science ALGORITHM BASED ON BLOCK CIPHER Indian Journal of Computer and Engineering (IJCSE), Vol. 2 No. 3 Jun-Jul.2011

AUTHORS Soubhik Kumar Dey is an M. Tech fellow in the department of Computer Science & Engineering in Narula Institute of Technology. He is a B. Tech in Computer Science and Engineering from Netaji Subhash Engineering College (West Bengal University of Technology).

Mr. Tarak Nandy is an Assistant Professor of Narula Institute of Technology, Agarpara, in the department of Computer Science & Engineering. He has Completed his B.Tech & M.Tech in Computer Science & Engineering. His area of interest is on Cryptography & Network Security, Steganography, Clustering, Classification, Digital and Medical Image processing

Volume 2 Issue 1 January 2014

Page 36