Encryption Algorithm For Secured File Transfer

BY CH. Hitosh Kumar N. Ramesh A.Naveen K. Sai kumar

Under the of guidance of Mr. P.Krishna Rao

ABSTRACT
This encryption algorithm is mainly designed for having a secured file transfer in the low privilege servers and as well as in a secured environment too. This methodology will be implemented in the data centre and other important data transaction sectors of the software will be done by the database administrator or system administrators and his trusted clients will have decoding process of the software.

This software will not be circulated to the unauthorised customers.

Introduction
This is mainly designed for having a secured file transfer in the low privilege servers and as well as in a secured environment too This will be implemented in the data centre and other important data transaction sectors of the software by the

database administrator or system administrators .

Trusted clients will have decoding process of the software. This software will not be circulated to the unauthorised customers.

 Terms used
Encryption is the process of transforming information (referred to as plain text) using an algorithm (called cipher) to make it unreadable to anyone except those possessing special knowledge, usually referred to as a key. Cipher (or cypher) is a pair of algorithms that create the encryption and the reversing decryption. Cipher Text is the result of the encryption process.

 Decryption is to make the encrypted information (cipher text) readable again (plain text). Key is a secret parameter (ideally known only to the communicants) for a specific message exchange context.

Cryptography Cryptography is the practice and study hiding information. Cryptography can be classified into two types:

of

Symmetric Key Cryptography Symmetric-key cryptography refers to encryption methods in which both the sender and receiver share the same key. This was the only kind of encryption publicly known until June 1976. Some of the examples of Symmetric-key cryptography categorically are: Block Ciphers Data Encryption Standard (DES), Advanced Encryption Standard (AES).

Public Key Cryptography In a groundbreaking 1976 paper, Whitfield Diffie and Martin Hellman proposed the notion of publickey (also, more generally, called asymmetric key) cryptography in which two different but mathematically related keys are useda public key and a private key. In public-key cryptosystems, the public key may be freely distributed, while its paired private key must remain secret. The public key is typically used for encryption, while the private or secret key is used for decryption.

Public-key algorithms are most often based on the computational complexity of "hard" problems, often from number theory. Some of the examples are: DiffieHellman RSA

Existing System
One of the prominent algorithm is RSA. Decryption Key Encryption key. can be deduced from

RSA works slower for longer key values

Proposed System
We need an algorithm that can provide better security with smaller key values. We need to encrypt data that can provide greater security even in low privileged servers This can be achieved easily if simple mathematical operations are employed

Modules
This algorithm mainly comprises of two modules : 1. Encryption 2. Decryption

Encryption
Process of performing various substitutions and transformations on the text in order to secure data from intruders.
Steps in Encryption: 1.RSA 2.Decimal to Binary Conversion 3.4B/5B encoding 4.Binary to Decimal Conversion 5.Logarithmic series

Figure 2.1 Steps in Encryption process

The modules in encryption are:

RSA Encryption process RSA algorithm (named after its founders, Ron Rivest, Adi Shamir, and Leonard Adleman) has become almost synonymous with public key cryptography. Steps involved in RSA are: Choose two large prime numbers, p and q.

Compute n = pq and z = (p-1)(q-1). Choose a number, e, less than n, which has no common factors (other than 1) with z. (In this case, e and z are said to be relatively prime). The letter 'e' is used since this value will be used in encryption.

Find a number, d, such that ed -1 is exactly divisible (i.e., with no remainder) by z .The letter d is used because this value will be used in decryption. Put another way, given e, we choose d such that the integer remainder when ed is divided by z is 1. (The integer remainder when an integer x is divided by the integer n, is denoted x mod n).
The public key that is available to the world is the pair of numbers (n,e). The private key is the pair of numbers (n,d).

To encrypt a number, m, such that m < n. The encrypted value, c, of the plaintext message, m is:
c = me mod n

Number Conversion (Decimal to Binary) In this step decimal numbers are converted into binary numbers. The above arrived result through RSA c will be converted into binary number (0s and 1s). . Digital Encoding (4B/5B Encoding) In digital encoding, binary numbers are encoded using 4B/5B encoding. So the binary data is grouped into four bit nibbles and each nibble is encoded into equivalent five bit symbol as per 4B/5B encoding scheme

 Number Conversion (Binary to Decimal) The binary number obtained by encoding scheme is converted back into equivalent decimal number, X. This conversion back to binary will be given different encrypted word because of the usage of 4B/5B line encoding. Mathematical Series (Logarithmic Series) The above obtained number X is substituted in the Logarithmic Series. So the final data f that is obtained is the result of log(X).

Decryption
Reverse process of encryption in which various transformations and substitutions on the encrypted data in order to get original data.

The inverse operations of Encryption process are

employed.

Mathematical Series (Exponential series) Exponential series is applied to the encrypted data obtained after encryption process, f. Exponential series is used because it is the reverse of logarithmic series because data on which logarithmic series is applied is obtained back. Number conversion (Decimal to Binary) In this step decimal numbers are converted into binary numbers. So the resultant value of exponential series is converted into binary .i.e. 0s and 1s.

 Number conversion (Binary to decimal) The binary number obtained using number conversion is converted back into decimal number. RSA decryption process Decryption process makes use of decryption key pair (n.d) obtained in RSA encryption process. To decrypt the text c in order to obtained original message m, we employ decryption principle: m = cd mod n

Software Requirements
Hardware Specifications: HDD Capacity 250 512 MB RAM Pentium III

Software Specifications ; The required software products are JDK 1.6 Net Beans 6.8 IDE

SCREENS SHOTS

Conclusion
This methodology will give the security to the files of small sizes. The main complexity it creates for the hackers is in the understanding the type of operations used here. This methodology will definitely be an effective way to

secure the files over the low privilege servers, which is

the main goal of project and it has been implemented.

Bibliography
Bhargav Balakrishnan, Three tier encryption algorithm for secure file transfer, IEEE Transactions on computer engineering and applications, Volume 2, pages 259-263, (19-21) March 2010. William Stallings, Cryptography and networks, Fourth Edition.

Herbert Schildt, JAVA 2 The complete Reference, TMH, Fourth edition.

Behrouz.A.Forouzan,Data communication and networks, Fourth Edition.

Thank You ..