Dynamic Routing With Security

Using A Blow Fish Algorithm

CONTENTS 1. Introduction

2. Existing system

3. Proposed system

4. Basic definition and concepts

5. Cryptography system

6. References

7. Conclusion

The dynamic routing provides to avoid two consecutive packets on the same link and updates the routing information from neighbors of the router in the network .

Blow fish algorithm which is a strongest security and fast the data processed from the client to the server.

Blowfish is a symmetric block cipher that can be used as a drop-in replacement for DES or IDEA.

It’s common aim to defeat threats over the internet.

INTRODUCTION

EXISTING SYSTEM IP Security (IPSec) and the Secure Socket Layer (SSL)

are popularly supported and implemented in many systems and platforms.

Although IPSec and SSL improve the security level for data transmission, they unavoidably introduce substantial overheads.

The algorithm was not provided strong security in the organization system, because it has to be less keys strength. such as DES, Triple DES and AES.

PROPOSED SYTEMExplore a strong security enhanced dynamic routing

based on cryptographic algorithm in existing wired and wireless networks.

Dynamic routing algorithm that could be randomizes delivery paths for data transmission over wired and wireless networks.

Providing a strongest security depends on key length from client to server within multiple- autonomous system.

Randomization of delivery paths for data transmission to provide considerably small path similarity

ADVANTAGES OF PROPOSED SYSTEM

Over head is minimized.Automation of path setupStrong security and fast data encryption and

decryption.Very less time for bulk encryption and data processed

in the cryptographic system.

BASIC DEFINITION AND CONCEPTS Distributed computingAutonomous systems Multi-Autonomous systemClient-Server SystemDynamic routing

DISTRIBUTED COMPUTING

It utilizes network of many computers We can share the work among all computersComputational result much more quicklyIt allows many users to interact openlyHigher degree of openness is beneficialIt supports scalability, as the no of systems increased the

overhead on the network

AUTONOMOUS SYSTEM

Single administration is needed It uses Interior Gateway Protocol(IGP)IGP is used for Intra-Autonomous communicationIGP is using in single autonomous systems like schools,

colleges, institutions, Banks, and small companies

MULTI-AUTONOMOUS SYSEMMultiple organizations with different administrationIt uses Border Gateway Protocol(BGP)It is used for Inter-Autonomous communicationsDifferent from other routing protocols BGP advertisements also include path information, along

with the reachable destination and destination pair It runs over TCP to maintain reliability issuesBGP allows a receiver to authenticate messages, so that

the identity of the sender can be verified

CLIENT-SERVER COMPUTING The diagram depicts typical

client server interactionsA server machine is a high

performance host A client machine initiates a

request Client machine shares

resources of server machine

It is a form of distributed computing

CRYPTOGRAPHY SYSTEMCryptography is the science of encrypting and decrypting

written communicationCryptanalysis is the process of trying to decrypt encrypted

data without the keyCryptosystem is the system that provides encryption and

decryption

CRYPTOGRAPHY SYSTEM (contd.)Plaintext: actual data Encryption alg:performs

substitutions and transformations on plain text

Cipher text: encrypted data

Secret key: input to the algorithm

Decryption alg: convert the cipher text in to plain text

BLOW FISH ALGORITHMBlowfish is a symmetric block cipher that can be

effectively used for encryption and safeguarding of data. It takes a variable-length key, from 32 bits to 448 bits,

making it ideal for securing data. Blowfish was designed in 1993 by Bruce Schneier as a

fast, free alternative to existing encryption algorithms. Blowfish is unpatented and license-free, and is available

free for all uses.

BLOW FISH ALGORITHMBlowfish Algorithm is a Feistel Network, iterating a

simple encryption function 16 times. The block size is 64 bits, and the key can be any length up

to 448 bits. Although there is a complex initialization phase required

before any encryption can take place, the actual encryption of data is very efficient on large microprocessors.

FEISTEL NETWORKSA Feistel network is a general method of transforming any

function (usually called an Ffunction). The working of a Feistal Network is given below:

Split each block into halves Right half becomes new left half New right half is the final result when the left half is

XOR’d with the result of applying f to the right half and the key.

Note that previous rounds can be derived even if the function f is not invertible.

FEISTEL NETWORK

BLOW FISH ALGORITHM Manipulates data in large blocks Has a 64-bit block size. Has a scalable key, from 32 bits to at least 256 bits. Uses simple operations that are efficient on

microprocessors.

BLOW FISH ALGORITHMBlowfish uses a large number of sub keys. These keys

must be precomputed before any data encryption or decryption

The P-array consists of 18 32-bit subkeys:P1, P2,..., P18There are four 32-bit S-boxes with 256 entries eachS1,0, S1,1,..., S1,255S2,0, S2,1,..,, S2,255S3,0, S3,1,..., S3,255S4,0, S4,1,..,, S4,255

BLOW FISH ALGORITHMBlowfish has 16 rounds.The input is a 64-bit data element, x.Divide x into two 32-bit halves: xL, xR.Then, for i = 1 to 16:xL = xL XOR PixR = F(xL) XOR xRSwap xL and xRAfter the sixteenth round, swap xL and xR again to undo

the last swap.

BLOW FISH ALGORITHMSwap xL and xRAfter the sixteenth round, swap xL and xR again to undo

the last swap.Then, xR = xR XOR P17 and xL = xL XOR P18.Finally, recombine xL and xR to get the ciphertext.

REPRESENTATION OF ‘F’

APPLICATIONS OF ALGORITHMBulk encryption: The algorithm should be efficient in

encrypting data files or a continuous data stream. Packet encryption: The algorithm should be efficient in

encrypting packet-sized data. (An ATM packet has a 48- byte data field.)

Hashing: The algorithm should be efficient in being converted to a one way hash function.

This algorithm is implemented on large, medium and small size processors.

COMPARISONS

CONCLUSIONIn this paper main objective is provide a fast data

encryption and decryption and strong security for data communication in the multiple-organization system.

The objective of the paper is a taking very less time for data processing to other algorithm and cost also very less to implement any kinds of the large networks we may use this algorithm, so The dynamic routing with security for data transmission in the multiple-organizations system

Queries?

REFERENCES B. Schneier, Applied Cryptography,

John Wiley & Sons, New York, 1994. B. Schneier, Description of a New Variable-Length Key,

64-Bit Block Cipher (Blowfish)Fast Software Encryption, Cambridge Security Workshop

Proceedings

(December 1993), Springer-Verlag, 1994, pp. 191-204.