International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 8, October - 2012 Non-Vulnerable Data Transfer System Using Cryptography Dr K Venkata Rao PhD Kalpana Mogadati Professor, Dept. of CSE M.Tech,CSE Vignan’s Institute of Information- Vignan’s Institute of Information - Technology Technology Duvvada,Visakhapatnam Duvvada,Visakhapatnam Abstract -- The aim of the Paper is to provide the decrease the file size. It will increase the security during transmission of the data. transmission speed here maintains compression Commonly used technologies are cryptography, and decompression technique based on the GZIP Compression and decompression. This can be Algorithm. Than perform the cryptography used for secure and fast sending for security technique based on the TINY Encryption purpose we are using the Cryptography technology Algorithm. In sending process the TCP and to increase the file transfer speed we are using (Transaction control protocol) was involved. the compression and decompression technologies. Keywords – TINY, GZIP, TCP, In this paper we described lot of processes for cryptography, compression, secure data transmission. First perform the decompression compression and decompression techniques for IJERT INTRODUCTION System definition is the process of obtaining server was only a data base server that can only offer a clear understanding of the problem space such as data. Therefore majority of the business logic i.e., your business opportunities; user needs, or market validations etc. had to be placed on the clients environment and defining an application or system to system. This makes maintenance expensive. Such clients solve that problem. In the existing system, file transfer are called as fat clients. This also means that every is not a secured transaction. User Profiles and access client has to be trained as to how to use the controls are not integrated to provide higher-level application and even the security in the security in data transfer. Encryption and decryption communication is also the factor to be considered. implementation through a character user interface is Since the actual processing of the data takes a complicated process where the user or the place on the remote client the data has to be administrator is to follow some complex process. transported over the network, which requires a The information generated at the client side secured format of the transfer method. How to while under the standard of transfer should be secure conduct transactions is to be controlled by the client enough and protected by any intrusions and and advanced techniques implementing the interceptions that may occur while the information is cryptographic standards in the executing the data transferred. The overall system should concentrate transfer transactions. Present day transactions are on the best algorithm that can be implemented for al considered to be "un-trusted" in terms of security, i.e. the resource standards that can be implemented as they are relatively easy to be hacked. Nevertheless, per the standards of the technical quality. sensitive data transfer is to be carried out even if there In the traditional 2tierarchitecture there is lack of an alternative. Network security in the existed only the server and the client. In most cases the existing system is the motivation factor for a new www.ijert.org 1 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 8, October - 2012 system with higher-level security standards for the cryptanalysis of the Tiny Encryption Algorithm. In this information exchange to provide ease and secured file research we inspected the most common methods in the maintenance and management in a distributed cryptanalysis of a block cipher algorithm. TEA seems environment. to be highly resistant to differential cryptanalysis, and So in this paper we are going to propose that achieves complete diffusion (where a one bit the system should have the following features: The difference in the plaintext will cause approximately transactions should take place in a secured format 32-bit differences in the cipher text) after only between various clients in the network. The validation six rounds. Time performance on a modern desktop code should be placed on the server and not on the computer or workstation is very impressive. client such that file transfer takes place between only As computer systems become more pervasive and the registered users only. This leads to a thin client, complex, security is increasingly important. which is more desirable. The server should identify Cryptographic algorithms and protocols constitute the the type of request (GET/POST), file access central component of systems that protect network permissions and perform appropriate action. It should transmissions and store data. The security of such also identify the user and provide the communication systems greatly depends on the methods used to according to the prescribed level of security with manage, establish, and distribute the keys transfer of the file requested and run the required Employed by the cryptographic techniques. Even if a process at the server if necessary. When responding cryptographic algorithm is ideal in both theory and to the client, the server should send necessary implementation, the strength of the algorithm will be information such as User authorization and rendered useless if the relevant keys are poorly authentication information, Encryption, Decryption managed. types and their level of hierarchy etc. The following notation is necessary for our discussion. RELATED WORK • Hexadecimal numbers will be subscripted with“h,”e.g.,10=16h In this paper we are going to focus on this following Bitwise Shifts: The logical shift of x by y bits is techniques in-order to send the data securely using denoted by x << y. The logical right shift of x by y cryptography. bits is denoted by x >> y. Bitwise Rotations: A left rotation of x by y bits is Compress and Decompress Technique: denoted by x <<< y. A right rotation of x by y bits is denoted by x >>> y. This technique maps arbitrary input into printable Exclusive-OR: The operation of addition of n- tuples character output. The form of encoding has the over the field (also known as 2F exclusive-or )is following relevant characterstics. IJERT denoted by xΘy The range of function is a character set that is The Tiny Encryption Algorithm is a Fiestel type cipher universally re-presentable at all sites, not a specific that uses operations from mixed (orthogonal) algebraic binary encoding of the character set. Thus, the groups. A dual shift causes all bits of the data and key characters themselves can be encoded into whatever to be mixed repeatedly. The key schedule algorithm is form is needed by a specific system .For instance, the simple; the 128-bit key K is split into four 32-bit character is represented in ASCII system as a blocks K = ( K[0], K[1], K[2], K[3]). TEA seems to be hexadecimal hexadecimal 45 and in EDCDIC- based highly resistant to differential cryptanalysis and system a hexadecimal- c5.The character set consists of achieves complete diffusion (where a one bit 65 printable characters, one of which is used for difference in the plaintext will padding. With 2^6 = 64 available characters, each cause approximately 32 character can be used to represent 6 bits of input. bit differences in the cipher text). Time performance on a workstation is very impressive. No control characters are included in the set. Thus, the Block ciphers where the cipher text is calculated from message encoded in Radix-64 can traverse mail- the plain text by repeated application of the same handling system. That scans the data stream for control transformation or round function. In a Feistel cipher, characters. The hyphen character "- " is not included the text being encrypted is split into two halves. The round function, F, is applied to one half using a sub CryptographyTechnique (TinyEncryption) key and the output of F is (exclusive- or-ed (XORed)) The Tiny Encryption Algorithm (TEA) is a with the other half. The two halves are then swapped. cryptographic algorithm designed to minimize memory Each round follows the same pattern except for the footprint and maximize speed. It is a Feistel type last round where there is often no swap. The focus cipher that uses operations from mixed (orthogonal) of this thesis is the TEA Feistel Cipher algebraic groups. This research presents the www.ijert.org 2 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 8, October - 2012 The inputs to the encryption algorithm are a plaintext Fig:2 Internal Details of TEA block and a key K .The plaintext is P = (Left[0], Right[0]) and the cipher text is C =(Left[64], Above Figure2 presents the internal details of the Right[64]). The plaintext block is split into two halves, ith cycle of TEA. The round function, F, consists of Left[0] and Right[0]. Each half is used to encrypt the the key addition, bitwise XOR and left and right other half over 64 rounds of processing and then shift operation. We can describe the output (Left[i combine to produce the cipher text block. +1] , Right[i +1] ) of the ith cycle of TEA with the • Each round i has inputs Left[i-1] and Right[i-1], input (Left[i] ,Right[i]) as follows Left [i+1] = derived from the previous round, as well as a sub key Left[i] F ( Right[i], K [0, 1], delta[i] ),Right [i +1] = K[i] derived from the 128 bit overall K. Right[i] F ( Right[i +1], K [2, 3], delta[i] ), delta[i] • The sub keys K[i] are different from K and from = (i+1)/2 * delta, each other. The round function, F, is defined by 1/2 31 F(M,K[j,k],delta[i])=((M<<4)K[J]Θ(M • The constant delta =(5 -1)*2 =9E3779B h,IJERT is delta[i])Θ((M>>5)K[k]).