IMPLEMENTATION OF SECURITY THROUGH SIMPLE SYMMETRIC KEY ALGORITHM BASED ON MODULO 37

The demand for adequate security to electronic data system grows high over the decades. Security is the one of the biggest concern in different type of networks. Due to diversify nature of network, security breaching became a common issue in different form of networks. Solutions for network security comes with concepts like cryptography in which distribution of keys have been done. Encryption and key generation became a vital tool for preventing the threats to data sharing and tool to preserve the data integrity so we are focusing on security enhancing by enhancing the level of encryption in network. This study‟s main goal is to reflect the importance of security in network and provide the better encryption technique for currently implemented encryption techniques in simple and powerful method. In our research we have proposed a modular 37 and select any number and calculate inverse of the selected integer using modular 37. The symmetric key distribution should be done in the secured manner. Also, we examine the performance of our new SSK algorithm with other existing symmetric key algorithm.


INTRODUCTION
Symmetric or secret key cryptography, a single key is used for both encryption and decryption. Sender uses the key using some set of rules to encrypt the plaintext and sends the ciphertext to the receiver. The receiver applies the same key or rule set to decrypt the message and recover the plaintext. Because a single key is used for both functions, secret key cryptography is also called symmetric key algorithm. The biggest difficulty with this approach, of course, is the distribution of the key.
Secret key cryptography schemes are generally categorized as being either stream ciphers or block ciphers. Stream ciphers operate on a single bit at a time and implement some form of feedback mechanism so that the key is constantly changing. A block cipher is so-called because the scheme encrypts one block of data at a time using the same key on each block. In general, the same plaintext block will always encrypt to the same ciphertext when using the same key in a block cipher whereas the same plaintext will encrypt to different ciphertext in a stream cipher.
Security issues are an important topic in data encryption/decryption methods. Several research papers have been analysed the security aspects in SSK (Simple symmetric key) algorithm. The SSK algorithm is also work with E-mail and Internet technologies for encryption of data transmissions. The communication between a sender and a receiver provides authentication to both parties to secure communication. [5]

RELATED WORKS
Hackers seem any target to data repositories due to availability of data on a single place. Encryption/Decryption has become a key component in any business competitive strategy. Organizations are gaining opportunities and benefits such as global presence and improved competitiveness from web-based security. Algorithm provides the capability to generate and verify signatures. Signature generation makes use of a private key to generate a digital signature. [6] The different methods are used in order to increase security are listed as below.
A.V.N.Krishna, Dr. A.Vinaya Babu in the year 2005 proposed new algorithm is combination of substitution cipher and ceaser algorithm. In this set of mono alphabetic substitution rule is used. This sequence is used to the character in the plain text by a particular chosen rule. In this method sequence of key used with each plain text message also the result combination produced alphabets and numbers, So that it is possible to retrieve the original message and key generation time is huge. [3] Ayushi in the year 2010 proposed symmetric algorithm Generate the ASCII value of the letter and corresponding binary value and reversing the binary and taking 4 digit divisor and proposed two reverse operation for making more secure. In this there is no standard key generation method and we have to convert value as a ASCII equivalent. It is suitable for small amount of data transaction. [2] Vishwa gupta,Gajendra Singh, Ravindra Gupta in January 2012 Proposed Algorithm (with 265 bit block size in this thesis) and new Symmetric key Cryptography Algorithm using extended MSA method. This entire method based on block cipher and key generation, encryption and decryption time is more. [1]

PROPOSED METHOD
Symmetric key is implemented in two ways either as a block cipher or stream cipher. Block cipher transforms a fixedlength block of plaintext say a fixed size of 64 data into a block of ciphertext (encrypted text) data of the same length. Asymmetric on the other hand allow encryption key of data to be made public for anyone intending to encrypt while only the recipient had access to the private key for decryption. Research on cryptographic mechanism had proved that symmetric algorithm is quicker to execute on a computer than asymmetric algorithm because of the use of one key for both w w w . c i r w o r l d . c o m operations. However in practice both keys are used together to encrypts and decrypts Computational requirements.
Our, New algorithm need following computational requirement to development of algorithm. First one is Plaintext, It is known as message and synthetic Data. We know that, whatever message or plaintext consist of Alphabets between A to Z and numbers which is between 0-9. Here, In New symmetric key algorithm, we introduce synthetic data, which is based on the sender"s message text. Normally the synthetic data value consists of equivalent value of alphabets and numbers. Alphabet value "A" is assigned as integer number 1 and "B=2 ……so on. Next we consider integer value "0" assigned as 27 and 1=28……9=36 also the space value considers as an integer number 37.
Second, inverse function, usually written as f-1(x), is a reflection of the original function, f(x), around the line y=x. basically, every x value is changed to a y value and every y value is change to an x value [4].

Key generation method
1) Select any natural number say as "n" 2) Find the Inverse of the number using modulo 37(key 1) say "k". 3) Again select any negative number (for making secured key)"n1". 4) Find the inverse of negative number using modulo 37(key 2)"k1".

IMPLEMENTATION
Here we are using symmetric encryption approach. We have already know that symmetric encryption approach is divide in two type one is block cipher symmetric cryptography technique and another is stream cipher symmetric cryptography but here we are choosing stream cipher type because its efficiency and security. In the proposed technique we have two common key between sender and receiver, which is known as private key. Basically private key concept is the symmetric key concepts where plain text is converting into encrypted text known as cipher text using private key where cipher text decrypted by same private key into plain text. The encryption key is trivially related to the decryption key, in that they may be identical or there is a simple transform to go between the two keys.
In order to provide quick and simple encryption/decryption, the bits size of the secret key has to be chosen effectively. For encrypting small amount of data, there should not be any overhead to the encrypting system as well as there should not be any compromise on the security level.

RESULTS AND DISCUSSIONS
The evaluation any type of cryptography algorithm with respect to various criteria includes performance, level of security, methods of operation, functionality, ease of implementation. We are using two parameters for encrypting and decrypting the message. Here we analysed proposed SSK algorithm with existing symmetric cryptographic algorithm.

CONCLUSION
From the result it is clear that our "proposed technique" is batter result producing as compared "DJSA symmetric key algorithm" and "Block cipher symmetric key algorithm. Cryptography is used to achieve few goals like Confidentiality. The Algorithm is very simple in nature and there are two inverse functions present in this algorithm. So, It would make it more secured. . For large amount of data transaction and commercial communication purpose this algorithm will work very smoothly. For a very large amount of data those algorithms wouldn"t be cost effective since those are not designed for large amount of data in minimal cost. The important thing of our proposed method is that it is almost impossible to break the encryption algorithm without knowing the exact key value. We propose that this encryption method can be applied for data encryption and decryption in any type of public application for sending confidential data.