Design and Development of a Dynamic Hashing Algorithm

Authors

  • Nasir Mahmud Apar Department of Computer Science and Engineering, World University of Bangladesh, Dhaka, Bangladesh
  • MD. Minhazul Islam Munna Department of Computer Science and Engineering, World University of Bangladesh, Dhaka, Bangladesh
  • Ahsan Ullah Department of Computer Science and Engineering, World University of Bangladesh, Dhaka, Bangladesh
  • Habibur Rahman Department of Computer Science and Engineering, World University of Bangladesh, Dhaka, Bangladesh

Keywords:

Hash, Hashing Algorithm, Bit Mixing, Shift in Row, Shift in Column, Data Integrity, SHA – 512, MD5

Abstract

The world is in front of a huge digital revolution. Pragmatically 59% people of the world population are now using the internet for their daily activities related to business, medical, industries, education. It’s a very big challenge to maintain the integrity of the shared data. Those issues can be solved by using a cryptographic technique called hashing. This paper demonstrates a new smooth cryptographic hashing algorithm based on Merkle–Damgård construction structure and Matyas-Meyer-Oseas compression function which generates hashes through 16 rounds where each block contains 256 bits of data. These blocks of data are processed through some existing and newly developed methods like bit scheduler, switching box, shift in column, shift in row, and bit mixing. This proposed algorithm works block-wise and can generate same level of hashes as SHA-512 and MD5. But it uses less time and resources than SHA-512 and MD5 for processing alphabet and numeric data.

 

References

Marc Stevens, Elie Bursztein, Pierre Karpman, “The ?rst collision for full SHA-1”, Annual International Cryptology Conference, 2017

Yuliang Zheng, Josef Pieprzyk, Jennifer Seberry, “HAVAL — A one-way hashing algorithm with variable length of output”, Advances in Cryptology — AUSCRYPT `92, 1993, Volume 718, ISBN : 978-3-540-57220-6

Kwok HS, Tang WKS, “A chaos-based cryptographic Hash function for message authentication.”, Int J Bifurcat Chaos 2005; 15:4043–50

Jean-S´ebastien Coron, Yevgeniy Dodis, C´ecile Malinaud, and Prashant Puniya, “Merkle-Damg?ard Revisited : how to Construct a Hash Function”, 2015

Downloads

Published

2022-02-28

How to Cite

[1]
N. M. Apar, M. M. I. Munna, A. Ullah, and H. Rahman, “Design and Development of a Dynamic Hashing Algorithm”, Int. J. Sci. Res. Comp. Sci. Eng., vol. 10, no. 1, pp. 8–14, Feb. 2022.

Issue

Vol. 10 No. 1 (2022): February

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.