Novel Approach for Key-Based Hashing Algorithm

• Main Authors: Shah, Kaushal, Joshi, Kunj, Parmar, Dwireph, Patel, Dhrumin, Padhya, Mukti
• Format: Conference Proceeding
• Language: English
• Subjects: Backtracking; Cryptography; Heuristic algorithms; Key-Based Hashing; Message Authentication Algorithm; Message Passing; Passwords; Performance analysis; Resistance; Security; Time complexity
• ISSN: 2642-6102
• DOI: 10.1109/TENSYMP55890.2023.10223660

The existing key-based hashing algorithms, such as HMAC, NMAC and GMAC are highly dependent on pre-existing hashing algorithms such as MD5 and SHA1 which are self-sufficient and independent from the usage of keys. Hence, as a result, the key-based hashing algorithms inherit many aspects of security from its underlying algorithm and usually enhance it. But this feature also accounts for the loopholes in key-based hashing algorithms. The key-based hashing algorithms also inherit the number of rounds, used to hash the message, from its underlying algorithm as well. A fixed number of rounds also allows attacks on particular rounds in the algorithm to crack it. In this paper, a new, independent hashing algorithm is introduced which does not have a fixed number of rounds and is based on basic mathematical and Boolean concepts of Bitwise Operators. The performance and security analysis have shown in results, that the proposed algorithm is resistant towards known attacks on hashing algorithms and a few other attacks proposed by other researchers. Its performance analysis shows that it works in O(k 3/2 ) time complexity which is efficient than O(k 2 ) Time Complexity used in many widely used Key-Based Hashing Algorithms.