ISSN ONLINE(23209801) PRINT (23209798)
Amazing porn model Belle Delphine nudes on sexelibre.org. Watch free video collection of Belle Delphine nede leaked
Rare Muslim porn and سكس on sexsaoy.com. Tons of Arab porn clips.
XNXX and Xvideos porn clips free on xnxxarabsex.com. Best XnXX porn tube channels, categorized sex videos, homemade and amateur porn.
Exlusive russian porn russiainporn.com. Get uniqe porn clips from Russia
Find out on sexjk.com best collection of Arabain and Hijab سكس
Paramjit Shah Singh^{1}, Ajay Kumar Agarwal^{2}

Related article at Pubmed, Scholar Google 
Visit for more related articles at International Journal of Innovative Research in Computer and Communication Engineering
There are many countermeasure methods that have been extensively studied to provide WSN communication security. However, WSN is still exposed to some kinds of attacks. These defenses are ineffective against attacks from compromised servers due to the WSN level constantly increasing, and attacks are becoming more and more complicated. Moreover WSN has some restrictions when it comes to its applications, like limited power supplies, low bandwidth, small memory sizes and limited energy, which make it more vulnerable.To this end, we propose a security algorithm keeping in mind the constraints of WSN. We have modified the Feistel algorithm by using controlled permutation boxes. The modified Feistel scheme design can meet today’s security challenges and generates highquality results.
INTRODUCTION 
Due to the increase in new trends of attack, previous security methods cannot combat or resist modern attacks. Analysis of work done in the field of encryption, shows that new and more stable security approaches need to be put in place to provide information safety taking into consideration the following attributes: availability, confidentiality, integrity authentication, and nonrepudiation.On designing WSN protocol it is necessary to consider all specific features of WSN. For example, communication bandwidth is extremely limited in these networks: each bit transmitted consumes about as much power as executing 800~1000 operational instructions, and as a consequence, any message expansion caused by security mechanisms comes at a significant cost.Limitations in computational and battery power in sensor nodes are constraints on the diversity of security mechanisms. We must apply only suitable mechanisms to WSN which motivates development of efficient encryption scheme. Our work is an endeavor to develop such cipher to provide efficient security for sensor nodes. This acceleratedcipher design uses Feistel scheme with datadependent permutations and more secure building blocks , and can be used for fast hardware, firmware, software and WSN encryption systems. The approach presented here is less likely to suffer, intrusion of differential cryptanalysis than currently used popular WSN ciphers like DES, Camellia and so on. 
II. LITERATURE REVIEW 
Block ciphers were developed in nineteen seventies and have been used to encrypt loads of valuable information while it is either stored or is in transit through network. Modern block ciphers have got a lot of strength through the work of Claude who introduced the idea of substitutionpermutation (SP) networks which form the basis of modern block ciphers. SP networks are based on the two primitive cryptographic operations Substitution and Permutation. To provide more security to a cipher[1] it may make use of both substitution as well as permutation that to several times (combinations). The work of Kelleher, L.; Meijer showed that use of SP network can protect against linear as well as differential attacks.[2][3]. 
Horst Feistel led to the invention of a suitable structure which adapted Shannon's SP network in an easily inverted structure. Essentially the same h/w or s/w is used for both encryption and decryption, with just a slight change in how the keys are used. It involves use of several key dependent rounds, involving a round function which involves use of substitution and permutation. The idea is to partition the input block into two halves, L(i1) and R(i1), and use only R(i1) in the ith round (part) of the cipher the function in each round, incorporates one stage of the SP network, controlled by part of the key K(i)known as the ithsubkey [4].In 1999 NIST announced the five algorithms : MARS[12], RC6[13], Rijndael[14], Serpent[15], and Twofish[16]. MARS breaks the 128bit input block into four 32bit words. MARS uses a 32round unbalanced Feistel network. RC6, a 20round Feistel cipher out of RSA Security Inc., is much simpler. “Prewhitening” and “Post whitening” steps have been used to increase the strength of algorithm. Twofish, is a 16 round Feistel network with two modifications. One is a onebit rotation before and after the data enters the round function. The other alteration is dynamic Sboxes. In serpent ,there are 32 rounds—a high number—each of which consists of XORing the key and the intermediate data, a pass through Sboxes, and a linear function that combines fixed rotations and XOR. Bruce Scheneir[17] proposed a fast and unpatented block cipher available freely to people for public use. Blowfish[18] is a secretkey block cipher, 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. 
III. PROPOSED ALGORITHM 
The Encryption Process 
First of all, given plaintext message is divided into blocks of 128 bits (or 16 characters).If the length of plaintext message is l and no. of plaintext blocks in this length are ‘n’ and if l < n*16, then original plaintext message is augmented with padding of blank spaces so that last block should also be of 16 characters (128 bits). 
Each of the blocks of plaintext message is encrypted to produce final block of ciphertext. 
Detailed Architecture of Encryption Process 
Encryption algorithm: 
1. Plaintext of 128 bits is XORED with first intermediate key K1 of 128 bits. 
2. The output of 128 bits is considered as consisting of two independent 64 bits left half (L0) & 64 bits right half (R0). 
3. L0R0 is passed through main function (F). 
4. The output of main function is 
LO’=R0 F(L0, K2) 
RO’=L0 
5. LO’RO’ is then passed through sub function which acts like a wrapper layer to strengthen the other half (RO’) using 128 bits key K3. 
6. 128 bits output of sub function is then passed through main function (F). 
7. Repeat steps 25 using intermediate keys K4 & K5 in main functions & sub main function. 
8. 128 bits output of sub function is then passed through main function (F). 
9. Repeat step 4 using intermediate keys K6. 
10. 128 bits output is XORED with 128 bits intermediate key K7 to generate 128 bits output. The detailed architecture of encryption process is shown below : 
The encryption process consist of following segments : 
1. Generation of intermediate keys 
2. Application of Main function 
3. Application of Sub function 
Alongwith this key whitening is used to ensure resistance against key search attack. 
In intermediate key generation, from main key of 128 bits main keys and sub keys are derived. 
The top and bottom rounds of the cipher play a different role than the middle rounds in protecting against cryptanalytical attacks. 
Therefore, in the design of this cipher the middle rounds are viewed as the “cryptographic core” and are designed differently than the top and bottom rounds, which are viewed as “wrapper layers”. 
A. Intermediate Key Generation 
New intermediate key is produced from existing key using followingalgorithms: 
B. Main Function 
The main function is the cryptographic core, which plays very important role in ensuring the security of the data. It performs substitution on left half of the input i.e. leftmost 64 bits, it produces prepurmuted output which is passed through CPB, which dynamically generated the permutation box which helps in rearranging the prepurmuted output to produce the permuted output. The block diagram of Main Function is shown below : 
C. SubMain Function 
This plays very important role, as it tightens the security further. This heterogeneous structure of Feistel cipher is far more secure than standard Feistel cipher where each step is just similar to previous one, hence is less resilient to attacks being predictive in nature. Output of main function is passed through the sub main function where shifting operation is performed using sub keys, ensuring better diffusion. 
The block diagram of Sub Main Function is shown below: 
D. Substitution 
• In principle, a carefully chosen substitution can provide good resistance against linear and differential attacks, as well as good avalanche of data and key bits. 
• A drawback of using Sbox lookups is that it is relatively slow for software implementations and in order to use all the bits of a data word, one needs to do several Sbox lookups, which slows the cipher even further. 
• Therefore, direct substitution is performed rather than large number of Sbox lookups. This approach prevents memory wastage and exhaustive computations. 
The block diagram of Substitution is shown below: 
Steps of Substitution Algorithm 
1. 64 left most bits (L0) is XORED with 64 bits of intermediate key i.e. 
oi = LOiki 
LOi = ith binary digit of plaintext 
ki = ith binary digit of key 
oi = ith binary digit of output 
= (XOR) operation 
E. CPBControllable Permutation Box 
• Keydependent, pseudorandomly generated controllable permutation boxes (CPB) are used. 
• Traditional systems, however, uses the cryptosystem itself to generate the Pboxes, which Produces weak PBoxes – here this approach is avoided. 
• Key dependent pseudo randomly generated CPB is used which is created at runtime only using the secret key, which is more secure than static PBox. 
• Permutation operation rearranges the contents and adds to diffusion in the given contents but if static permutation tables are used, they get easily attacked than when CPB based key dependent permutations are used. 
• CPB are fast even if implemented in cheap hardware or limited resource devices. 
CPBControllable Permutation BoxGeneration 
1. The ith row of the matrix is rotated k[i+1] times 
IV. PERFORMANCE COMPARISON OF PROPOSED ALGORITHM 
By considering different sizes of data blocks the algorithms are evaluated in terms of the time required to encrypt and decrypt the data block. The time between two test points in the algorithm during execution is calculated using system clock. The number of bytes encrypted in one second is ascertained. 
The comparison between proposed algorithm (CPBFEISTEL CIPHER) with standard algorithms given below reveals the fact that proposed algorithm, performs better than other algorithms. 
References 
[1]. Bilstrup, U., Sjoberg, K., Svensson, B., Wiberg, P.A., 2003. Capacity Limitations in Wireless Sensor Networks. Proc. 9th IEEE Int. Conf. on
Emerging Technologies and Factory Automation, Lisbon, Portugal, p.529536. [2]. Bodrov, A.V., Moldovyan, A.A., Moldovyan, P.A., 2005. DDPbased ciphers: differential analysis of SpectrH64. [3]. Comput. Sci. J. Mold., 13(3):268291. Feistel, H., 1973. Cryptography and computer privacy. Sci.Am., 228(5):1523. [4]. Goots, N.D., Moldovyan, A.A., Moldovyan, N.A., 2001. Fast encryption algorithm a need LNCS, 2052:275 286. [doi:10.1007/354045116 1_27] [5]. Elena C. Laskari, Gerasimos C. Meletiou and Michael N. Vrahatis, “Utilizing Evolutionary Computation Methods for the Design of SBoxes”, Federal InformationProcessing Standards Publication 197 November 26, 2001. [6]. Announcing the Advanced Encryption Standard (AES), Federal Information Processing Standard Publication197,November 26, 2001. [7]. Juan Soto and Lawrence Bassham, “Randomness Testing of the Advanced EncryptionStandard Finalist Candidates”, Computer Security Division, National Institute of Standards and Technology, March 28, 2000 [8]. Susan landau “communications security for the twentyfirst century:the advanced encryption standard” the notices of the AMS,volume 47,no.4,apr 2000. [9]. SchneierB.,“Fast Software Encryption” , Cambridge Security Workshop Proceedings (December 1993), SpringerVerlag, 1994, pp. 191 204,1993 [10]. AameerNadeem , Dr. M. YounusJaved " A performance analysis of of data encrption standard ", 0780394216/2005 IEEE. [11]. Susan Landau “Standing the Test ofTime: The DataEncryption Standard”, Notices of the AMS march ,Vol47,No.3 ,MARCH2000. [12]. Carolynn Burwick, Don Coppersmith, Edward D.Avignon, “The MARS Encryption Algorithm”,CiteSeer,1997. [13]. Ronald L. Rivest1, M.J.B. Robshaw2, R. Sidney2, and Y.L. Yin2, “The RC6 Block Cipher” M.I.T. Laboratory for Computer Science report, pp 2030, 1998. [14]. Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, NielsFerguson“TwofishA 128Bit Block Cipher”,CiteSeer,1998. [15]. Ross Anderson1,EliBiham, Lars Knudsen, “Serpent: A Proposal for the Advanced Encryption Standard”2000. [16]. Christophe De Canniere , Alex Biryukov and Bart Preneel " An introduction to block crypt Analysis " proceedings of the IEEE,vol 94,no.2,2006. [17]. PriyaDhawan, “Performance Comparison: Security Design Choices”,Microsoft Developer Network,October 2002. [18]. Schneier B., “Description of a New VariableLength Key, 64Bit Block Cipher (Blowfish)”Fast Software Encryption, Cambridge Security Workshop Proceeding,,SpringerVerlag, pp. 191204, 1994. 