Mr. Tadesse Hailu Ayane Journal of Engineering Research and Application www.ijera.com ISSN : 2248-9622, Vol. 8, Issue5 (Part -V) May 2018, pp 51-56 RESEARCH ARTICLE OPEN ACCESS Message Authentication in wireless Networks using HMAC algorithm. Mr. Tadesse Hailu Ayane*, Mr.Temesgen Bailie Workie**, Mr.G.Subba Rao,Lecturer***, *(Lecturer & Department Head, School of Electrical Engineering & Computing, Adama Science & Technology University) ** (Lecturer, School of Electrical Engineering & Computing, Adama Science & Technology University) *** (Research Scholar, Sri Satya Sai University, India) Corresponding Auther: Mr. Tadesse Hailu Ayane ABSTRACT A message is to be transferred from one network to another across some sort of internet. To do this a logical information channel should established by defining a route through the internet from source to destination with the help of some protocols. A security-related transformation on the information to be sent, with some secret information as secret key will be shared by the two networks and, it is hoped, unknown to the opponent. Wireless networks are increasingly being used in the network with limited cost and low equipment requirement. However, the growing popularity and widespread applications of wireless networks are directly proportionate to their security exploitation. The strength of its infrastructure also becomes the point of its greatest availability in the network. Thus decreasing the confidence level of the system as it pertains to availability, reliability, data integrity and privacy concerns. Message authentication is used to protecting the integrity of a message and validating identity of originator. The algorithm used in this paper for authenticating messages is Hash Message Authentication Codes (HMAC) with stream ciphering. Key words: Stream cipher, HMAC algorithm, constrained environment, WEP protocol. ----------------------------------------------------------------------------------------------------------------------------- ---------- Date of Submission: 18-05-2018 Date of acceptance: 01-06-2018 ----------------------------------------------------------------------------------------------------------------------- ---------------- I. INTRODUCTION: active nodes status was determined by the routing In the networks providing Key protocol in the network design. By using the Authentication for the message is a standard operating environment and purpose of the nodes challenge and response mechanism that makes use will find the limitation in the network. of WEP. While the message is encrypting the access point is used to generate shared secret key II. HMAC ALGORITHM: and responsible for providing authentication to the 2.1 HMAC Design Objectives. message. The authenticating client will forward the To use, without modifications, available hash encrypted text to the access point for verification. functions. In particular, hash functions that Authentication succeeds if the access point perform well in software, and for which code decrypts the same challenge text and gets the is freely and widely available. original message. For Implement above operation a To allow for easy replace ability of the compact HMAC by the use of stream ciphering is embedded hash function in case faster or more presented in this paper. secure hash functions are found or required. A hash function such as SHA does not To preserve the original performance of the relay on a secret key that is why it will not be used hash function without incurring a significant in MAC. There are number of protocols which will degradation. support secret key into hash algorithm among that To use and handle keys in a simple way. the best suit of protocol is HMAC .HMAC is the To have a well understood cryptographic essential secured algorithm to implement in MAC analysis of the strength of the authentication for internet protocol security. mechanism based on reasonable assumptions In the wireless environment Wireless ad about the embedded hash function. hoc networks are the decentralized networks where 2.2 HMAC Algorithm. there is no infrastructure to manage the traffic for the information between the existing nodes. The www.ijera.com DOI: 10.9790/9622-0805055156 51 | P a g e Mr. Tadesse Hailu Ayane Journal of Engineering Research and Application www.ijera.com ISSN : 2248-9622, Vol. 8, Issue5 (Part -V) May 2018, pp 51-56 The longer the period of repeat the more difficult it will be to do cryptanalysis. This is essentially the same consideration that was discussed with reference to the Viennese cipher, namely that the longer the keyword the more difficult the cryptanalysis. The key stream should approximate the properties of a true random number stream as close as possible. For example, there should be an approximately equal number of 1s and 0s. If the key stream is treated as a stream of bytes, then all of the 256 possible byte values should appear approximately equally often. The more random- appearing the key stream is, the more Randomized the cipher text is, making cryptanalysis more difficult. 2.4 Wired equivalent privacy protocol .Wired Equivalent Privacy (WEP) Protocol is a standard security feature in the IEEE 802.11 standard, for wireless networks to provide confidentiality and encryption to the network. WEP is unsecured because any one can crack with the help of automated tools. Hence this protocol is will be used only when some encryption standard have to Fig. 1. HMAC algorithm representation. include. S-1:append zeros to the left end of k to create a III. NETWORK AVAILABILITY b-bit string k+ 3.1 Node Failure and Topological Changes. S-2:xor k+ with ipad to produce the b-bit block When there is more redundancy in the Si. network generally network node is going to be S-3:append M to Si. failed. For higher amount of data transmission s-4:apply H to the stream generated in step-3 network it has to adjust the topology. This can be + S-5:XOR K with opad to produce the b-bit done by using the network routing protocol. block S 0 . Step-6: Append the hash result from step-4 to 3.2. Denial of Service Attacks. It is the most SO . common attack to deny the network availability. Step-7:Apply H to the stream generated in This attack is also named as Physical level attack. step6 and output the result. Ipad : a string of repeated 0x36 00110110,00110110, . .,00110110 Opad : is a string of repeated 0x5C 01011100,01011100, . .,01011100 HMAC(K,M) = H( (K+⊕opad) | H( (K+ ⊕ ipad)| M) ) 2.3 Stream cipher structure. A typical stream cipher encrypts plaintext one byte at a time, although a stream cipher may be designed to operate on one bit at a time or on units larger than a byte at a time. The output of the generator, called a key stream, is combined one byte at a time with the plaintext stream using the bitwise exclusive-OR (XOR) operation. The following parameters are the Design considerations for a stream cipher. The encryption sequence should have a large period. A pseudorandom To transmit the data between two nodes in number generator uses a function that produces a wireless environment we use CSMA/CA (carrier deterministic stream of bits that eventually repeats. sense multiple access with collision www.ijera.com DOI: 10.9790/9622-0805055156 52 | P a g e Mr. Tadesse Hailu Ayane Journal of Engineering Research and Application www.ijera.com ISSN : 2248-9622, Vol. 8, Issue5 (Part -V) May 2018, pp 51-56 avoidance)protocol. While transmitting data first 09776530956043287 check the availabily of the channel, if the channel 656574758984575680912 is idle then only data will be passed through the 567287556779209402493 channel otherwise it has to wait until the channel hmac.txt is free. 44<;8:6;<3983<:9;8; 3.3 3<::9863<893765;: Passive 9898:7:8;<;78:89;3<45 Attack. 89:5;:889::<53<7357<6 These attacks are affecting the output.txt confidentiality of the data. The intruder does not 1198573890650976858 modify the data, only monitors and predicting the 09776530956043287 data. This attack will happen in the network when 656574758984575680912 there is no encryption for the data. Test case-2 3.4. input.txt Active dhsdyy33 duwu8hef7 Attack. f37yr8 hdjeju9hfe3ipd These attacks will bring many changes in cnipo73903jkaeklkej the network data. It will modify, completely delete eruoer730903rkle37hkjpdgdfi the data. Some examples of active attacks are data gfh72y92bdlwdlk2uepek interruption, interception, modification and hmac.txt fabrication. gkvg||66#gxzx;khi: i6:|u;#kgmhmx<kih6lsg IV. RELATED WORK AND THE fqlsr:6<36mndhnonhm STRUCTURE OF THE PAPER. huxrhu:63<36unoh6:knmsgjgil As indicated, compact MAC jik:5|<5egozgon5xhshn implementations is very help full in restricted output.txt places. Possible implementations of hash in such dhsdyy33 duwu8hef7 environments, based on block ciphers, are surveyed f37yr8 hdjeju9hfe3ipd in [11]. On the other hand, stream cipher is always cnipo73903jkaeklkej adding with message data. Secure and well- eruoer730903rkle37hkjpdgdfi analyzed stream ciphers offered by the stream gfh72y92bdlwdlk2uepek project are very compact and use limited hardware DATA FLOW BETWEEN SOURCE-1TO resources. MAC based stream ciphers are always DESTINATION-1 greater efficiency and minimal resources can be used, about such implementations are explained ind [20], [21], [22], [23]. These approaches concern stream-cipher-based designs dedicated to MAC implementations, combining hashing and encryption within an integrated solution. It is the purpose of this paper to illuminate the use of stream ciphers incompact hashing from a different angle. Here, a one-way block transformation, based on a stream cipher, is first implemented as a stand- alone universal circuit. This can also be turned into an HMAC implementation. In this paper the data is flowing between two wireless nodes as source-1 to destination-1.The path choosing between these nodes as shown in the results. Result at the time 1.10864 sec assume the source station is 21node and the destination station is at node 27 and the key length .data length are 20 in bits,8 in bytes are shown in the result. V. SIMULATION RESULTS: Test case-1 input.txt 1198573890650976858 www.ijera.com DOI: 10.9790/9622-0805055156 53 | P a g e Mr.