Randomness Analyses of the Secure Hash Algorithms, SHA-1, SHA-2 and Modified SHA
- 1 December 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 316-3165
Abstract
This 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.Keywords
This publication has 9 references indexed in Scilit:
- The Sponge Structure Modulation Application to Overcome the Security Breaches for the MD5 and SHA-1 Hash Functions2019
- A Big Data Storage Scheme Based on Distributed Storage Locations and Multiple Authorizations2019
- Mitigation and Improving SHA-1 Standard Using Collision Detection Approach2018
- A statistical test suite for random and pseudorandom number generators for cryptographic applications2010
- Bayesian t tests for accepting and rejecting the null hypothesisPsychonomic Bulletin & Review, 2009
- How to Break MD5 and Other Hash Functions2005
- Empirical evidence concerning AESACM Transactions on Modeling and Computer Simulation, 2003
- A New Statistical Testing for Symmetric Ciphers and Hash Functions2002
- Bayes FactorsJournal of the American Statistical Association, 1995