Analisis Kinerja Algoritma Hash pada Keamanan Data: Perbandingan Antara SHA-256, SHA-3, dan Blake2

Authors

  • Joice Sharon Gabriella Sinaga Institut Teknologi Del
  • Nehemia Sitorus Institut Teknologi Del
  • Steven Lukas Samosir Institut Teknologi Del

DOI:

https://doi.org/10.62375/jqc.v2i2.432

Keywords:

Algoritma Hash, sha-256, sha-3, blake2, data security

Abstract

Data security is an essential aspect in the dynamic digital age, including protection of data integrity, confidentiality and authentication. This research evaluates the performance and security of three popular hash algorithms: SHA-256, SHA-3, and Blake2. Resistance to brute force attacks, avalanche effects, and processing time efficiency were analyzed. Results show that all algorithms have excellent resistance to brute force attacks, thanks to the 256-bit hash length. In terms of avalanche effect, SHA-3 shows higher consistency than the other algorithms, making it superior in maintaining data integrity. In terms of processing time efficiency, Blake2 performed best with the fastest hashing time, while SHA-256 offered balanced efficiency for general applications. SHA-3, although slower, has advantages in security and resistance to collision attacks. Overall, SHA-3 is recommended for applications with high security requirements, Blake2 is suitable for applications that prioritize efficiency, and SHA-256 remains relevant for applications that require a balance between speed and security.

Downloads

Published

2024-12-28

How to Cite

Sinaga, J. S. G., Nehemia Sitorus, & Steven Lukas Samosir. (2024). Analisis Kinerja Algoritma Hash pada Keamanan Data: Perbandingan Antara SHA-256, SHA-3, dan Blake2. JURNAL QUANCOM: QUANTUM COMPUTER JURNAL, 2(2), 9–16. https://doi.org/10.62375/jqc.v2i2.432