Analysis of the efficiency of SHA algorithms based on message length

This study analyzes the efficiency of SHA (Secure Hash Algorithm) family algorithms depending on message length. The execution time of hashing processes for SHA-1 and SHA-2 (SHA-224, SHA-256, SHA-384, SHA-512) algorithms is compared across various message lengths. Python programming language is used for implementation, and the results are presented in graphical and tabular forms. The study examines the computational complexity and performance speed of these algorithms. The main objective is to determine the efficiency of each algorithm relative to message length and recommend an optimal option for practical applications. Special attention is given to balancing execution speed and computational complexity. The results highlight similarities and differences among the algorithms, providing valuable insights for selecting the most efficient algorithm in real-time systems or large-scale data processing.

Authors

Publication Details

Journal
Международный Журнал Теоретических и Прикладных Вопросов Цифровых Технологий
Published
2025-04-06
DOI
https://doi.org/10.62132/ijdt.v8i1.245
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of the efficiency of SHA algorithms based on message length

Sh. Sadullaeva
Международный Журнал Теоретических и Прикладных Вопросов Цифровых Технологий
Advanced Computing and Algorithms
article

Analysis of the efficiency of SHA algorithms based on message length

Sh. Sadullaeva
article en

Abstract

This study analyzes the efficiency of SHA (Secure Hash Algorithm) family algorithms depending on message length. The execution time of hashing processes for SHA-1 and SHA-2 (SHA-224, SHA-256, SHA-384, SHA-512) algorithms is compared across various message lengths. Python programming language is used for implementation, and the results are presented in graphical and tabular forms. The study examines the computational complexity and performance speed of these algorithms. The main objective is to determine the efficiency of each algorithm relative to message length and recommend an optimal option for practical applications. Special attention is given to balancing execution speed and computational complexity. The results highlight similarities and differences among the algorithms, providing valuable insights for selecting the most efficient algorithm in real-time systems or large-scale data processing.

Международный Журнал Теоретических и Прикладных Вопросов Цифровых ТехнологийVol. 8(1)
Openalex Percentile: Top 91%
Advanced Computing and Algorithms
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.