A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Reducing Hash Function Complexity: MD5 and SHA-1 as Examples
2019
International Journal of Mathematical Sciences and Computing
Hash functions algorithms also called message digest algorithms, compress a message input of an arbitrary length, and produce an output with a fixed length that is distributed randomly. Several hash algorithms exist such as Md5 and SHA1. These algorithms verify data integrity and restrict unauthorized data modification. However, they experience some complexities, especially when implemented in bitcoin mining, and low computation devices, in particularly IoT devices. As a remedy, this paper
doi:10.5815/ijmsc.2019.01.01
fatcat:q4bfeoqhyjcepcaljxeoygitha