Security and Performance Analysis of Hash Algorithms with a Black Box Testing Approach
摘要
Hash algorithms are essential for attaining data integrity, authenticity, and security in the age of digital communications. Several key hashing algorithms, including MD5, SHA1, SHA256, SHA512, SHA3-256, BLAKE2b, and SHAKE256-1024, as well as an unknown SHA256 version, are the subject of the project’s performance and security analyses. A thorough overview of these algorithms is presented at the paper’s outset, emphasizing their significance for cryptographic applications. The paper thoroughly examines each algorithm’s effectiveness in real-world scenarios, which is crucial considering the constantly changing environment of cybersecurity. The study uses black box testing to analyze cryptographic qualities such as avalanche effect, bit independence, compression ratio, speed, entropy, uniformity, and sensitivity while concentrating on input-output behaviors. Empirical tests were carried out using the cryptography packages provided by Python to assess these algorithms according to important security criteria. According to the results, BLAKE2b is extremely fast, attaining 699050.67 hashes per second, and it has strong cryptographic features such as high entropy (3.9255 bits/byte) and bit independence (266 bits). Although slower, SHAKE256-1024 has the maximum entropy (3.9416 bits/byte). MD5 lacks contemporary security but has the best avalanche effect (58.59%). The unidentified SHA256 variation slows down by 67.9% but gains a little in cryptographic metrics. The results show that while BLAKE2b is the quickest algorithm and best suited for high-speed applications, SHA256 and SHAKE256-1024 exhibit improved security features, making them perfect for applications needing increased cryptographic strength. The findings highlight the necessity for careful selection depending on application needs, showing that SHA256 and SHAKE256-1024 stand out for their security while BLAKE2b shines in speed.