Implementation of a Data-Parallel Approach on a Lightweight Hash Function for IoT Devices

The Internet of Things is used in many application areas in our daily lives. Ensuring the security of valuable data transmitted over the Internet is a crucial challenge. Hash functions are used in cryptographic applications such as integrity, authentication and digital signatures. Existing lightweight hash functions leverage task parallelism but provide limited scalability. There is a need for lightweight algorithms that can efficiently utilize multi-core platforms or distributed computing environments with high degrees of parallelization. For this purpose, a data-parallel approach is applied to a lightweight hash function to achieve massively parallel software. A novel structure suitable for data-parallel architectures, inspired by basic tree construction, is designed. Furthermore, the proposed hash function is based on a lightweight block cipher and seamlessly integrated into the designed framework. The proposed hash function satisfies security requirements, exhibits high efficiency and achieves significant parallelism. Experimental results indicate that the proposed hash function performs comparably to the BLAKE implementation, with slightly slower execution for large message sizes but marginally better performance for smaller ones. Notably, it surpasses all other evaluated algorithms by at least 20%, maintaining a consistent 20% advantage over Grostl across all data sizes. Regarding parallelism, the proposed PLWHF achieves a speedup of approximately 40% when scaling from one to two threads and 55% when increasing to three threads. Raspberry Pi 4-based tests for IoT applications have also been conducted, demonstrating the hash function’s effectiveness in memory-constrained IoT environments. Statistical tests demonstrate a precision of ±0.004, validate the hypothesis in distribution tests and indicate a deviation of ±0.05 in collision tests, confirming the robustness of the proposed design.