For Project Enquiry +91 9791 044 044

EFFICIENT AUTHENTICATION FOR MOBILE

AND PERVASIVE COMPUTING

ABSTRACT:-

An application in which messages that need to be exchanged are short and both their privacy and integrity need to be preserved, rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of such applications, the confidentiality and integrity of the communicated messages are of particular interest. In this, two narrative 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.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING SYSTEM: If the authenticated message must also be encrypted, existing MACs are not designed to utilize the functionality that can be provided by the underlying encryption algorithm. MACs are designed for the general computer communication systems, independently of the properties that messages can possess.	PROPOSED SYSTEM: The Novelty of the proposed scheme is to utilize the encryption algorithm to deliver a random string and use it to reach the simplicity and efficiency of one-time pad authentication without the need to manage impractically long keys .
EXISTING TECHNIQUE Message Authentication Code (MAC).	PROPOSED TECHNIQUE MAC with Pseudo random number.
TECHNIQUE DEFINITION Message authentication code (MAC) algorithms that are designed for the sole purpose of preserving message integrity. Based on their security, MACs can be either unconditionally or computationally secure.	TECHNIQUE DEFINITION The authentication algorithm can benefit from the simplicity of unconditional secure authentication to allow for faster and more efficient authentication, without the difficulty to manage one-time keys
DRAWBACKS MACs are inefficient when the messages to be authenticated are short   Given that messages are relatively long can be performed computationally secure and speed MACs in the literature of cryptography.	ADVANTAGES Messages are relatively short, addition and modular multiplication can be performed faster than existing computationally secure MACs. This methodology is more simplicity and efficiency than regular MACs.