Upgrading Hash Function Selection Techniques Based on Message Contents
Author(s):
G.SHIREESHA, Mr.K.Venkata Ramana
Keywords:
HMAC, Hash Function Table, Hash Functions' Random Selection Techniques
Abstract
In Hash based Security frameworks two central point that are for the most part depended upon are Strong Hash work and the determination strategy of the hash work from a given pool. This paper goes for misusing most extreme accessible assets a message has, naturally, that can oblige more noteworthy number of hash capacities references. It gives a basic, minimal effort simple to execute method that will have the capacity to make frameworks accessible with irregular hash capacities' determination capacity. With the given strategy the security level will be improved alongside more prominent accessibility of hash capacities. The genuinely factor nature of substance of messages can be misused keeping in mind the end goal to secure messages incalculable. In the event of a solitary correspondence spell, in the event that one hash work is bargained the following hash work for next square will be chosen really haphazardly and can't be anticipated. A rundown of as of now being used strategies is likewise talked about keeping in mind the end goal to demonstrate the suggestion particular and practicable. In proposed system it is demonstrated that it has capacity to suit more noteworthy number of hash capacities. Further, the hash work determination philosophy has been provisioned with a system to be message-subordinate; the security can't be traded off attributable to genuinely arbitrariness of the choice technique.
Article Details
Unique Paper ID: 145536
Publication Volume & Issue: Volume 4, Issue 10
Page(s): 585 - 589
Article Preview & Download
Share This Article
Join our RMS
Conference Alert
NCSEM 2024
National Conference on Sustainable Engineering and Management - 2024