Visible to the public Randomness Analyses of the Secure Hash Algorithms, SHA-1, SHA-2 and Modified SHA

TitleRandomness Analyses of the Secure Hash Algorithms, SHA-1, SHA-2 and Modified SHA
Publication TypeConference Paper
Year of Publication2019
AuthorsAl-Odat, Zeyad, Abbas, Assad, Khan, Samee U.
Conference Name2019 International Conference on Frontiers of Information Technology (FIT)
KeywordsBayesian, Bayesian tests, compositionality, corresponding hash function, cryptography, CUDA parallel computing platform, famous secure hash algorithms SHA-1, generated hash, hash, hash algorithms, hash output, high performance computing testbed, Merkle Damgård structure, modified SHA, odd ratio tests, output hash, parallel processing, pubcrawl, randomness, randomness analyses, Resiliency, secure hash algorithm, security analysis scheme, SHA-1, SHA-2 hash functions
AbstractThis paper introduces a security analysis scheme for the most famous secure hash algorithms SHA-1 and SHA-2. Both algorithms follow Merkle Damgård structure to compute the corresponding hash function. The randomness of the output hash reflects the strength and security of the generated hash. Therefore, the randomness of the internal rounds of the SHA-1 and SHA-2 hash functions is analyzed using Bayesian and odd ratio tests. Moreover, a proper replacement for both algorithms is proposed, which produces a hash output with more randomness level. The experiments were conducted using a high performance computing testbed and CUDA parallel computing platform.
DOI10.1109/FIT47737.2019.00066
Citation Keyal-odat_randomness_2019