Design of a New Security Protocol Using Hybrid Cryptography

Subasree & Sakthivel ? spirit of a refreshed trade protection communications protocol IJRRAS 2 (2) ? February 2010 DESIGN OF A NEW SECURITY protocol utilise HYBRID CRYPTOGRAPHY ALGORITHMS S. Subasree and N. K. Sakthivel School of calculation, Sastra University, Thanjavur 613401, Tamil Nadu, INDIA. ABSTRACT A inscriber nedeucerk is an interconnected group of autono mous computing nodes, which economic consumption a comfortably defined, mutually concur set of rules and conventions known as protocols, act with nonp atomic number 18il -an separate meaningfully and allow election sharing p constituteably in a predict commensurate and controllable manner. intercourse has a majo r impact on today? s business. It is desired to communicate info with elevated shelter. bail Attacks compromises the aegis and hence conf apply regular and asymmetric cryptological algorithmic ruleic programs move over been proposed to acquire the security department services such as A uthentication, Confi dentiality, Integrity, Non-Repudiation and Availability. At present, various types of cryptologic algorithms fork up high security to study on controlled ne bothrks. These algorithms atomic number 18 call for to fork over data security and engagers trus devilrthyity.To improve the cogency of these security algorithms, a radical security protocol for on line traffic send away be designed victimisation combination of twain symmetric and unsymmetric cryptological techniques. This protocol provides tierce cryptographic pr imitives such as integrity, confidentiality and authentication. These three primitives feces be achieved with the help of egg-shaped crook crypt outline, three-fold -RSA algorithm and means Digest MD5. That is it uses egg-shaped arch cryptogram for encryption, ternary -RSA algorithm for authentication and MD-5 for integrity.This hot security protocol has been designed for get out security with integrity employ a combi nation of some(prenominal) symmetric and asymmetrical cryptographic techniques. lynchpinwords Network security system, elliptical Curve cryptology, doubled-RSA, Message Digest-5. 1. INTRODUCTION Curiosity is one of the most common human traits, matched by the wish to conceal hidden study. Spies and the army all resort to shootive information privacy to pass heart and souls bulletproofly, virtually ms deliberately including tawdry information 12. Steganography, a mechanism for hiding information in app bently sp be pictures, whitethorn be employ on its own or with other methods. encoding basically consists of scrambling a mental object so that its contents are not readily social while decoding is the reversing of that process14. These processes depend on particular algorithms, known as computes. suitably scrambled school text is known as consider text while the buffer is, not surprising ly, plain text. legibility is neither a necessary nor fitting conditio n for something to be plain text. The real skill well not send a crap any(prenominal) obvious sense when read, as would be the case, for example, if something already encrypted were existence elevate encrypted.Its excessively quite possible to induce a mechanism whose output is clean text simply which genuinely bears no relationship to the unencrypted pilot program. A fall upon is use in concurrency with a cipher to encrypt or rewrite text. The backbone might appear meaningful, as would be the case with a character eviscerate employ as a password, plainly this transformation is irrelevant, the occasionality of a account lies in its being a string of bits find out the mapping of the plain text to the cipher text. 1. 1 Why we need secret writing?Protecting access to information for springs of security is still a major reason for apply cryptography. However, its similarly increasingly used for identification of individuals, for authentication and for non -re pudiation. This is particularly classical with the growth of the Internet, global trading and other activities12. The identity of e -mail and Web users is trivially easy to conceal or to forge, and secure authentication give the axe give those interacting remotely confidence that theyre dealing with the right soulfulness and that a heart and soul hasnt been forged or changed.In commercial situations, non-repudiation 12 is an important concept ensuring that if, say, a contract has been sumd upon one fellowship thattockst then renege by claiming that they didnt actually agree or did so at some unlike snip when, perchance, a price was higher or lower. digital signatures and digital timestamps are used in such situations, often in conjunction with other mechanisms such as heart and soul digests and digital certificates. 95 Subasree & Sakthivel ? objective of a New protection protocol IJRRAS 2 (2) ? February 2010The range of uses for cryptography and related techniques is respectable and growing steadily. Passwords are common but the protection they offer is often illusory, perhaps because security policies within umteen organizations arent well thought out and their use causes more than problems and inconvenience than seems worth it14,15. In umteen cases where passwords are used, for example in defend word processed documents, the ciphers used are exceedingly lightweight and can be attacked without difficulty using one of a range of freely available faulting programs. 2.TYPES OF CRYPTOGRAPHIC ALGORITHMS 2. 1. Elliptic Curve encryption When using elliptic lifts in cryptography11, we use various properties of the points on the curve , and persists on them as well. Thus, one common task to complete when using elliptic curves as an encryption tool is to find a way to turn information m into a point P on a curve E. We assume the information m is already written as a number. There are many ways to do this, as bare(a) as setting the letters a = 0 , b = 1, c = 2, . . . or in that respect are other methods, such as ASCII, which accomplish the similar task.Now, if we have E y2 = x3 + Ax + B (mod p), a curve in Weierstrass form, we want to let m = x. But, this exit scarcely work if m3 + Am + B is a whole(a) modulo p. Since only fractional of the numbers modulo p are squares, we only have more or slight a 50% chance of this derivering. Thus, we will discipline to embed the information m into a nourish that is a square. Pick some K such that 1/2K is an refreshing ruin rate for embedding the information into a point on the curve. Also, make for certain that (m + 1)K p. Let xj = mK + j for j = 0, 1, 2, . . . ,K ? 1 direct x 3j + Axj + B.Calculate its square prow yj (mod p), if possible. If on that point is a square root, we let our point on E representing m be P m = (xj , yj) If at that place is no square root, try the following look on of j4,5. So, for each value of j we have a probability of about 1/2 that x j is a square modulo p. Thus, the probability that no xj is a square is about 1/2K, which was the acceptable visitation rate6. In most common applications, there are many real-life problems that may occur to damage an attempt at move a message, like computer or electricity misery.Since people accept a certain 16 amount of failure due to uncontrollable phenomenon, it makes sense that they could agree on an acceptable rate of failure for a controllable feature of the process. though we will not use this circumstantial process in our algorithms10. 2. 2. duple RSA In practice, the RSA decoding enumerations are commited in p and q and then combined via the Chinese residual Theorem (cathode-ray tube) to obtain the desired solution in ? N, instead of directly computing the involvement in ? N. This decreases the computational live of decoding In two ways.First, computations in ? p and ? q are more efficient than the same computations in ? N since the elements are more midgeter. Second, from Lagrange? s Theorem, we can replace the esoteric exponent d with dp = d mod (p 1) for the computation in ? p and with dq = d mod (q 1) for the computation in ? p, which reduce the cost for each exponentiation when d is larger than the primes. It is common to refer to dp and dq as the CRT -exponents. The commencement exercise method to use the CRT for decipherment was proposed by Quisquater and Couvreur 7,8.Since the method requires knowledge of p and q, the backbone generation algorithm unavoidably to be modified to output the individual(a) observe (d, p, q) instead of (d,N). Given the pri vate rouge (d, p,q) and a valid ciphertext C ? ? N, the CRTdecryption algorithm is as follows 1) Compute Cp = Cdp mod p. 2) Compute Cq = Cdq mod q. 3) Compute M0 = (Cq Cp) . p-1 mod q. 4) Compute the plaintext M = Cp + M0 . p. This version of CRT-decryption is simply granary? s Algorithm for the Chinese equipoise Theorem applied to RSA.If the key generation algorithm is further modified to output the private key (dp, dq, p, q, p -1 mod q), the computational cost of CRT-decryption is dominated by the modular exponentiations in steps 1) and 2) of the algorithm. When the primes p and q are roughly the same size (i. e. , half the size of the modulus), the computational cost for decryption using CRT -decryption (without parallelism) is theoretically 1/4 the cost for decryption using the captain method7. Using RSA-Small-e along with CRT-decryption allows for extremely fast encryption and decryption that is at most four times faster than measurement RSA. 96IJRRAS 2 (2) ? February 2010 Subasree & Sakthivel ? Design of a New surety communications protocol 2. 3 MD5 Algorithm MD52 consists of 64 of these operations, grouped in four bends of 16 operations. F is a nonlinear run for one function is used in each round. Mi denotes a 32 -bit cube of the message input, and Ki denotes a 32 -bit constant, different for each operation. s is a strip value, whic h also varies for each operation1. MD5 processes a unsettled length message into a intractable -length output of 128 bits. The input message is crushed up into chunks of 512-bit closings the message is padded so that its length is divisible by 512.The magnify works as follows first a single bit, 1, is appended to the end of the message. This is followed by as many zeros as are required to bring the length of the message up to 64 bits less than a ninefold of 512. The re of importing bits are filled up with a 64-bit integer representing the length of the original message9. The main MD5 algorithm operates on a 128 -bit state, divided into four 32-bit words, de renowned A, B, C and D. These are initialized to certain fixed constants. The main algorithm then operates on each 512 -bit message lay off in turn, each block modifying the state.The processing of a message block consists of four similar stages, termed rounds each round is composed of 16 similar operations based on a non -linear function F, modular addition, and left rotation. Many message digest functions have been proposed and are in use today. Here are simply a few like HMAC, MD2, MD4, MD5, SHA, SHA-1. Here, we trim down on MD5, one of the widely used digest functions. 3. HYBRID SECURITY PROTOCOL ARCHITECTURE It is desired to communicate data with high security. At present, various types of cryptographic algorithms provide high security to information on controlled networks.These algorithms are required to provide data security and users authenticity. This new security protocol has been designed for go security using a combination of both symmetric and asymmetric cryptographic techniques. ready to 1 crossing Protocol computer architecture As shown in the think, the Symmetric come across Cryptographic techniques such as Elliptic Curve Cryptography, and MD5 are used to achieve both the Confidentiality and Integrity. The Asymmetric appoint Cryptography technique, soprano RSA used for Au thentication. The above discussed three primitives can be achieved with the help of this security system Protocol Architecture.The Architecture is as shown in the finger 1. As shown in the figure, the Symmetric Key Cryptographic Techniques such as Elliptic Curve Cryptography, and MD5 are used to achieve bo th the Confidentiality and Integrity. The Asymmetric Key Cryptography technique, dual RSA used for Authentication. 97 Subasree & Sakthivel ? Design of a New Security Protocol IJRRAS 2 (2) ? February 2010 The new Security Protocol has been designed for better security. It is a combination of both the Symmetric and Asymmetric Cryptographic Techniques.It provides the Cryptographic Primitives such as Integrity, Confidentiality and Authentication. The given plain text can be encrypted with the help of Elliptic Curve Cryptography, ECC and the derived cipher text can be communicated to the destination with any secured channel. Simultaneously, the haschisch value is calculated through MD5 for the same plain text, which already has been born-again into the cipher text by ECC. This haschisch value has been encrypted with Dual RSA and the encrypted message of this Hash value also sent to destination. The intruders may try to hack the original information from the encrypted messages.He may be trapped both the encrypted messages of plain text and the hash value and he will try to decrypt these messages to get original one. He might be get the hash value and it is impossible to extract the plain text from the cipher text, because, the hash value is encrypted with Dual RSA and the plain text is encrypted with ECC. Hence, the message can be communicated to the destination with highly secured manner. The new hash value is calculated with MD5 for the received originals messages and then it is analyzed with decrypted hash message for its integrity.By which, we can ensure that either the origi nal text being altered or not in the dialogue medium. This is the primitive fe ature of this crisscross protocol. 4. RESULTS AND CONCLUSION 4. 1 Comparison of RSA and Dual RSA 1) The in the public eye(predicate) Key Algorithms, RSA and Dual-RSA have been implemented in VC++ and we got the following results. As shown in the mental image 2, the original message for communication is stored in My archive. txt and its size is 547 Bytes, which is shown in the piece of music file. go in 2 Input File MyFile. txt prognosticate 3 shows that the project main menu, which consists of various features. They are i. RSA encoding, ii.RSA decoding, iii. Dual RSA Encryption, iv. Dual RSA decipherment, and v. Graph, which is used to compare the computational costs of both the RSA and Dual -RSA prognosticate 4 shows that RSA Encryption and Figure 5 shows that Dual RSA encryption. From the figure 6 it is clear that the RSA take one block at a time for encryption and decryption at a time. But the dual RSA take more time for encryption of two block at a time, but it take le ss time for decryption of two blocks. So, the RSA encryption and decryption time is greater than Dual RSA because Dual RSA perform the encryption and decryption operation for two blocks. 8 IJRRAS 2 (2) ? February 2010 Subasree & Sakthivel ? Design of a New Security Protocol Figure 3 Process of RSA and Dual RSA Encryption/ decryption Figure 4 RSA Encryption 99 Subasree & Sakthivel ? Design of a New Security Protocol IJRRAS 2 (2) ? February 2010 Figure 5 Dual RSA Encryption 5. 2 transaction analysis of RSA and Dual RSA Figure 6 RSA vs Dual RSA 100 IJRRAS 2 (2) ? February 2010 Subasree & Sakthivel ? Design of a New Security Protocol Figure 7 computational costs of RSA vs Dual RSA Figure 6 shows that the Perfor mance Analysis of RSA vs Dual RSA.From this figure, it is clear that the entireness computation time for Encryption and Decryption of Dual -RSA is less than that of ordinary RSA. From the Figure 7, it is observed that the tally computation time for Encrypt ion and Decryp tion of RSA is 4314ms as compared with the total computation time for Encryption and Decryption of Dual RSA is 3203ms for the file size 547 Bytes. From the analysis it is clear that Dual RSA is better than RSA algorithm. So, for authentic ation we are going to use Dual RSA. Dual RSA take two block for encryption and decryption simultaneously. . 3 Results of crossbred protocol Architecture Here, we are using three different system of operation. The sender, liquidator and Intruder. We have t o select the mode and process the information. The following figure represent the three different mode. Figure 8 Mode selection If the mode is the sender, then we have to provide the key val ue and messages in the specified location. Figure 9 Sender Mode 101 Subasree & Sakthivel ? Design of a New Security Protocol IJRRAS 2 (2) ? February 2010 Figure 10 shows that the receiving system received the sender message with the key.From the figure, it is noted that, the intruder also received the ke y and not the message. Because, the message is encrypted with ECC and key is encrypted by using Dual RSA. And also noted that, the intruder derived different key for decryption, which is equivalent to the original key. Even though the intruder got the key he cannot able to get the orig inal message because of Dual RSA. Because of Dual RSA we got two advantages one is the message cannot be decrypted and time required to perform the encryption and decryption operation less compare to RSA because Dual RSA perform encryption and decryption by two block at a time.The new Public Key Cryptographic algorithm, Dual RSA has been developed for better murder in terms of computation costs and memory storage requirements. It is also called RSA -CRT, because it is used Chinese Remainder Theorem, CRT for its Decryption. From the output, it is noted that Dual -RSA improved the performance of RSA in terms of computation cost and memory storage requirements. It achieves parallelism. The CRT Decrypti on is achieved roughly ? times faster than original RSA. Figure 10 Secured communication of cross Protocol 102 IJRRAS 2 (2) ? February 2010 Subasree & Sakthivel ?Design of a New Security Protocol 6. REFERENCES 1 2 3 4 5 6 7 B. den Boer and A. Bosselaers, An attack on the last two rounds of MD4, Advances in Cryptology, Crypto ? 05, pages 194-203, Springer-Verlag, 2005. B. den Boer and A. Bosselaers, Collisions for the compression function of MD5, Advances in Cryptology, Eurocrypt 07, pages 293-304, Springer-Verlag, 2007. D. Bleichenbacher and A. May, New attacks on RSA with microscopical CRTexponent in Pub lic Key Cryptography, PKC 2006, volume 3968 of Lecture Notes in electronic computer Science, pages 1 13. Springer-Verlag, 2006. D. Bleichenbacher and A.May, New attacks on RSA with small secret CRT -exponents, in Public Key CryptologyPKC 2006, ser. Lecture Notes in figurer Science. New York Springer, 2006, vol. 3958, pp. 113. D. Boneh and G. Durfee, cryptography of RSA with pr ivate key d less than N , IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 13391349, Jul. 2000. E. Jochemsz and A. May, A multinomial time attack on standard RSA with private CRT -exponents, 2007. Hung-Min Sun, and et al. , Dual RSA and its Security Analysis, IEEE Tra nsaction on Information Theory,Aug 2007, pp 2922 2933,2007 8 H. -M. Sun, M. J.Hinek, and M. -E. Wu, On the design of Rebalanced-RSA, revised version of 37 center for Applied Cryptographic Research, Technical opus CACR 2005 -35, 2005 Online. Available http//www. cacr. math. uwaterloo. ca/techreports/2005/cacr2005 -35. pdf 9 H. Dobbertin, The Status of MD5 later a Recent Attack, CryptoBytes, 2(2) 1-6, 2007. 10 M. J. Hinek, some other look at small RSA exponents, in Topics in Cryptology-CT-RSA 2006, ser. Lecture Notes in Computer Science, D. Pointcheval, Ed. New York Springer, 2006, vol. 3860, pp. 82 98. 11 N. Gura, A. Patel, A. Wander, H. Eberle, and S.C. Shantz, Comparing Elliptic Curve Cryptography and RSA on 8-bit CP Us. minutes of Workshop on Cryptographic ironware and Embedded Systems (CHES 2004), 6th International Workshop, pages 119 132, 2004. 12 Ravindra Kumar Chahar and et. al. , Design of a new Security Protocol, IEEE International Conference on computational Intelligence and Multimedia Applications, pp 132 134, 2007 13 Ramaraj, E and Karthikeyan, S, A Design of Enhanced Security Protocol for Wireless Communication using Hybrid Encryption Technique, Indian Journal of Computing Technology, pp 22 -29, May, 2006. 14 S. D. Galbraith, C. Heneghan, and J. F. McKee, Tunable fit of RSA, 2005. Updated ACISP 2005. version of 15 S. D. Galbraith, C. Heneghan, and J. F. McKee, Tunable balancing of RSA, in Proc. Inf. Security and Privacy, 10th Australasian Conf. , ACISP 2005, C. Boyd and J. M. G. Nieto, Eds. , 2005, vol. 3574, pp. 280 292, Springer, Lecture Notes in Computer Science. biography Dr. S Subasree got unmarried man Degree from Madras university in 1991 and she done her mail service graduate course from Bharathidasan Univeristy in 1995 and M. hil from Manonmaniam Sundaranar Univeristy in 2001. She done her M. Tech and Ph. D in SASTRA University in 2006 and 2009 respectively. She got 13 years instruction experience. Now she will be share as a Senior Assistant Professor in SASTRA Univeristy, Tamil Nadu, India. She has published more than 15 papers in International and internal Journals and Conferences. Her research area includes Network Security, richly Performance Soft Computing Techniques, Communication Network, and B iometric Cryptography. Dr. N K Sakthivel got Bachelor Degree from Madras university in 1991 and she one her post graduate degree from Bharathidasan Univeristy in 1994 and M. phil from Bharathidasan Univeristy in 2000. She done her M. Tech and Ph. D in SASTRA University in 2004 and 2009 respectively. She got 15 years teaching experience. Now She will be serving as a Professor in SASTRA Univeristy, Tamil Nadu, India. She has published more tha n 18 papers in International and study Journals and Conferences. Her research area includes High quicken Communication Networks, Network Security, High Performance Computing, and Biometric Cryptography. 103