Design and Implementation of an Efficient Collision Resistant Novel Hash Function for IOT

Abstract

The ever-growing proliferation of communication facilities in modern times has led to a widespread adoption of Internet of Things. Such networks deal with a number of difficulties in maintaining user data security, privacy, and trust. It becomes difficult to provision the aforementioned services, particularly when working with real-time streaming data. When handling sensor network contents and streaming data, the consequences of privacy and confidentiality violations become more severe. A crucial idea in offering Internet of Things as a service is secure authentication while transmitting data between sender and recipient nodes. Such an authentication technique for IoT-based applications can be provided via hash algorithms. Secure data retrieval and effective access control on large-scale IoT networks need the integration of authentication technologies with IoT and cloud computing. It may not be wise to rely on a single cryptographic protocol or algorithm for all applications. If a flaw is found in one algorithm, the danger of a catastrophic failure is decreased by diversity provided by new algorithms. In this study, we suggest, put into Implement and evaluate the Novel Hash Function designed on the base of Bellman Equation. This function takes mutable length input and produces a fixed length hash 256 bits and 128 bits are the two different lengths for hash values. The performance of the suggested approach is compared to that of the traditional hash algorithms, including SHA-2, SHA-3 and other existing hash functions. The results of the statistical tests and cryptanalytic analyses show how reliable the suggested unkeyed hash functions. This collision Résistant Hash Function.can be applied for secure signature schemes, pseudorandom number generation, session key generation, etc.