Dynamic Routing With Security Using a Blow FISH ALGORITHM | Cryptography | Secure Communication

Dynamic Routing With Security Using A Blow Fish Algorithm

CONTENTS
1. 2. 3. 4. 5. 6. 7. Introduction Existing system Proposed system Basic definition and concepts Cryptography system References Conclusion

 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  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. .

EXISTING SYSTEM  IP Security (IPSec) and the Secure Socket Layer (SSL) are popularly supported and implemented in many systems and platforms. because it has to be less keys strength.  Although IPSec and SSL improve the security level for data transmission. Triple DES and AES.  The algorithm was not provided strong security in the organization system. they unavoidably introduce substantial overheads. . such as DES.

 Randomization of delivery paths for data transmission to provide considerably small path similarity .autonomous system.  Providing a strongest security depends on key length from client to server within multiple.  Dynamic routing algorithm that could be randomizes delivery paths for data transmission over wired and wireless networks.PROPOSED SYTEM  Explore a strong security enhanced dynamic routing based on cryptographic algorithm in existing wired and wireless networks.

 Very less time for bulk encryption and data processed in the cryptographic system.ADVANTAGES OF PROPOSED SYSTEM  Over head is minimized. .  Automation of path setup  Strong security and fast data encryption and decryption.

BASIC DEFINITION AND CONCEPTS  Distributed computing  Autonomous systems  Multi-Autonomous system  Client-Server System  Dynamic routing .

DISTRIBUTED COMPUTING  It utilizes network of many computers  We can share the work among all computers  Computational result much more quickly  It allows many users to interact openly  Higher degree of openness is beneficial  It supports scalability. as the no of systems increased the overhead on the network .

Banks.AUTONOMOUS SYSTEM  Single administration is needed  It uses Interior Gateway Protocol(IGP)  IGP is used for Intra-Autonomous communication  IGP is using in single autonomous systems like schools. and small companies . colleges. institutions.

along with the reachable destination and destination pair  It runs over TCP to maintain reliability issues  BGP allows a receiver to authenticate messages.MULTI-AUTONOMOUS SYSEM  Multiple organizations with different administration  It uses Border Gateway Protocol(BGP)  It is used for Inter-Autonomous communications  Different from other routing protocols  BGP advertisements also include path information. so that the identity of the sender can be verified .

CLIENT-SERVER COMPUTING  The diagram depicts typical     client server interactions A 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 SYSTEM  Cryptography is the science of encrypting and decrypting written communication  Cryptanalysis is the process of trying to decrypt encrypted data without the key  Cryptosystem is the system that provides encryption and decryption .

)  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 .CRYPTOGRAPHY SYSTEM (contd.

free alternative to existing encryption algorithms.BLOW FISH ALGORITHM  Blowfish is a symmetric block cipher that can be effectively used for encryption and safeguarding of data.  Blowfish is unpatented and license-free. making it ideal for securing data. . from 32 bits to 448 bits. and is available free for all uses.  Blowfish was designed in 1993 by Bruce Schneier as a fast.  It takes a variable-length key.

BLOW FISH ALGORITHM  Blowfish Algorithm is a Feistel Network.  Although there is a complex initialization phase required before any encryption can take place. and the key can be any length up to 448 bits. iterating a simple encryption function 16 times.  The block size is 64 bits. . the actual encryption of data is very efficient on large microprocessors.

 Note that previous rounds can be derived even if the function f is not invertible.FEISTEL NETWORKS  A 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. .

FEISTEL NETWORK .

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

0.255 S4.0... These keys       must be precomputed before any data encryption or decryption The P-array consists of 18 32-bit subkeys:P1...... S1. S4.255 S2...1. S2. S1... S4.1.255 .0..1.0. S2..1.. P18 There are four 32-bit S-boxes with 256 entries each S1. S3..BLOW FISH ALGORITHM  Blowfish uses a large number of sub keys. P2... S3.255 S3....

 Divide x into two 32-bit halves: xL. for i = 1 to 16:  xL = xL XOR Pi  xR = F(xL) XOR xR  Swap xL and xR  After the sixteenth round. swap xL and xR again to undo the last swap.  Then.  The input is a 64-bit data element. xR.BLOW FISH ALGORITHM  Blowfish has 16 rounds. . x.

xR = xR XOR P17 and xL = xL XOR P18.BLOW FISH ALGORITHM  Swap xL and xR  After the sixteenth round. . recombine xL and xR to get the ciphertext. swap xL and xR again to undo the last swap.  Finally.  Then.

.

REPRESENTATION OF ‘F’ .

)  Hashing: The algorithm should be efficient in being converted to a one way hash function. .  Packet encryption: The algorithm should be efficient in encrypting packet-sized data. (An ATM packet has a 48byte data field.APPLICATIONS OF ALGORITHM  Bulk encryption: The algorithm should be efficient in encrypting data files or a continuous data stream. medium and small size processors.  This algorithm is implemented on large.

COMPARISONS .

so The dynamic routing with security for data transmission in the multiple-organizations 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.CONCLUSION  In this paper main objective is provide a fast data encryption and decryption and strong security for data communication in the multiple-organization system.

 Queries? .

Applied Cryptography. pp. 64-Bit Block Cipher (Blowfish)  Fast Software Encryption. Description of a New Variable-Length Key. Springer-Verlag.REFERENCES  B. Schneier. 1994. . John Wiley & Sons. Cambridge Security Workshop Proceedings (December 1993).  B. 191-204. 1994. New York. Schneier.

Sign up to vote on this title
UsefulNot useful