Tamer omar mohamed diab
Asst. Professor
Design and Analysis of New Version of Cryptographic Hash Function Based on Improved Chaotic Maps with Induced DNA Sequences
IEEE Access • 2023
Publication Information
Authors
Salwa M. SeragEldin, Ahmed A. Abd. El-Latif, Samia A. Chelloug, Musheer Ahmad, Ahmed H. Eldeeb, Tamer O. Diab, Wageda I. Al sobky, Hany Nasry Zaky
Keywords
Hash Function; Altered Sine-Logistic based Tent map; Cubic Tent map; DNA sequence.
Journal
IEEE Access
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
One of the first and most used hashing algorithms in blockchains is SHA-256 so the main
aim of this paper is how to increase the security level of the blockchain based on the increasing hashing
algorithm security. This paper proposes to present a modified SHA-256 like hash algorithm by exploring
the design principles of the two hash schemes (SHA-256 and RIPEMD-160). To retrieve the increased
security in the proposed algorithm, we modify the SHA-256 after the public key generation. The proposed
modification is based on four different chosen types of chaotic maps and DNA sequences which eventually
complicate the association between the original message and hash digest i.e., maximizing the security level,
and minimizing its vulnerabilities. The proposed hash function efficiency is practically assessed, analyzed,
and compared with the well-known SHA-256 with respect to the main properties of the confusion, diffusion
and distribution. The security performance is also analyzed using the analysis of collision, which reveals
that the new constructed hash function improves SHA-256 with respect to the security and robustness.
From the experimental analyses results, the proposed modified hash scheme found to exhibit the better
security performance than many state-of-the art existing hash function schemes.
aim of this paper is how to increase the security level of the blockchain based on the increasing hashing
algorithm security. This paper proposes to present a modified SHA-256 like hash algorithm by exploring
the design principles of the two hash schemes (SHA-256 and RIPEMD-160). To retrieve the increased
security in the proposed algorithm, we modify the SHA-256 after the public key generation. The proposed
modification is based on four different chosen types of chaotic maps and DNA sequences which eventually
complicate the association between the original message and hash digest i.e., maximizing the security level,
and minimizing its vulnerabilities. The proposed hash function efficiency is practically assessed, analyzed,
and compared with the well-known SHA-256 with respect to the main properties of the confusion, diffusion
and distribution. The security performance is also analyzed using the analysis of collision, which reveals
that the new constructed hash function improves SHA-256 with respect to the security and robustness.
From the experimental analyses results, the proposed modified hash scheme found to exhibit the better
security performance than many state-of-the art existing hash function schemes.