Enhancing the Performance of Cryptographic Hash Function Using 2080 Bits Proposed Secure Hash Algorithm 160

An on-way hash code or message authentication code is generated using the cryptographic hash functions. It used to be password storage, electronic data integrity, and check verification. Cryptographic hashing algorithms, which employ beginning value and key constant to boost algorithm complexity, have been proposed by a number of academics. It is well known that they have a very high temporal complexity due to the quantity of steps and memory space needed to store the beginning value and key constants. Consequently, we are improving the cryptographic hash function's performance by using 2080 bits as a block of the input message and avoiding the need for the key constant. By doing this, we are generating 160-bit fixed-length hash code, and the amount of time spent on the function proposal will be reduced in comparison to previous hash algorithms. The outcome will be compared using the amount of time in seconds that the cryptographic hash algorithms consumed during computation.

Authors

Institutions

Publication Details

Journal
International Journal of Scientific Research in Network Security and Communication
Published
2025-02-28
DOI
https://doi.org/10.26438/ijsrnsc.v13i1.264
Citations
1
Primary Topic
Cryptographic Implementations and Security
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing the Performance of Cryptographic Hash Function Using 2080 Bits Proposed Secure Hash Algorithm 160

Babasaheb Ambedkar
1 citations
International Journal of Scientific Research in Network Security and Communication
Cryptographic Implementations and Security
2.48
article

Enhancing the Performance of Cryptographic Hash Function Using 2080 Bits Proposed Secure Hash Algorithm 160

Babasaheb Ambedkar
article en
1 citations

Abstract

An on-way hash code or message authentication code is generated using the cryptographic hash functions. It used to be password storage, electronic data integrity, and check verification. Cryptographic hashing algorithms, which employ beginning value and key constant to boost algorithm complexity, have been proposed by a number of academics. It is well known that they have a very high temporal complexity due to the quantity of steps and memory space needed to store the beginning value and key constants. Consequently, we are improving the cryptographic hash function's performance by using 2080 bits as a block of the input message and avoiding the need for the key constant. By doing this, we are generating 160-bit fixed-length hash code, and the amount of time spent on the function proposal will be reduced in comparison to previous hash algorithms. The outcome will be compared using the amount of time in seconds that the cryptographic hash algorithms consumed during computation.

International Journal of Scientific Research in Network Security and CommunicationVol. 13(1)
M.J.P. Rohilkhand University (IN)
Openalex Percentile: Top 11%
Cryptographic Implementations and Security
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.