Exchanged Secure Hashing Algorithm (ESHA-512) For Blockchain Technology

Authors

  • S. Jenifa Sabeena Research Scholar,Department of Computer Science and Engineering, Manonmaniam Sundaranar University,Tirunelveli, Tamil Nadu, India
  • S. Antelin Vijila Assistant Professor,Department of Computer Science and Engineering, Manonmaniam Sundaranar University,Tirunelveli, Tamil Nadu, India

Keywords:

ESHA-512, blockchain, algorithm, technology.

Abstract

The key strength of blockchain technology depends on the encryption algorithm as well as hashing technique.  Hashing converts the transaction data of the block to a fixed length value to represents the original data. Hashing encryption algorithms such as MD5, SHA-1, SHA-512 etc., can be applied to different aspects apart from blockchain.  This paper introduces a novel Exchanged SHA-512 algorithm which is an improved version of SHA-512 with lesser number rounds as 60 where in traditional SHA-512 it is 80 rounds. This proposed ESHA-512 algorithm computes the hashing functions with different types of register as related position of the registers chosen in SHA-512. The initial hash value arrangement is also depending on the length of the message either in odd or even. Due to this enhancement the proposed ESHA-512 improves the strength as well as reduces the overall computation of the algorithm considerably than the existing SHA-512.   The proposed ESHA-512 algorithm also increases encryption data size per second than the SHA-512 algorithm. The evaluation of all kinds of hashing algorithms with different number of blocks in blockchain technology is clearly stated in this paper.

Downloads

Published

2024-09-13

How to Cite

S. Jenifa Sabeena, & S. Antelin Vijila. (2024). Exchanged Secure Hashing Algorithm (ESHA-512) For Blockchain Technology. Journal of Computational Analysis and Applications (JoCAAA), 33(07), 476–486. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1084

Issue

Section

Articles

Similar Articles

<< < 22 23 24 25 26 27 28 29 > >> 

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