Comparative Study of MAC Algorithms in Pervasive Computing Environment

Nowadays coming technology, many applications dependupon the existence of small devices that can exchange, share the information and formcommunication networks. In an expressive manner of such applications, the confidentiality and integrity of the communicated messages are of particular interest area. In this paper work, we going to propose two novel techniques for authenticating short encrypted messages that are directed to meet the requirements of mobile and pervasive applications. By taking advantage of the fact that the message to be authenticated must also be encrypted, we propose provably secure authentication codes that are more efficient than any message authentication code in the literature. The key idea behind the proposed techniques is to utilize the security that the encryption algorithm can provide to design more efficient authentication mechanisms, as opposed to using standalone authentication primitives. The main use of one way cryptographic hash function for message authentication. A popular example of iterated cryptographic hash functions in the design of message authentication codes is HMAC, which was proposed by Bell are et al.