Analisis Perbandingan BLAKE2S dan SHA3-512 dalam Pengujian Ketahanan terhadap Serangan Bruteforce

Rizky Akbar Mokolanot; Eliasta Ketaren; Mans Lumiu Mananohas

doi:10.30865/json.v7i3.9667

Authors

Rizky Akbar Mokolanot Universitas Sam Ratulangi
Eliasta Ketaren Universitas Sam Ratulangi
Mans Lumiu Mananohas Universitas Sam Ratulangi

DOI:

https://doi.org/10.30865/json.v7i3.9667

Keywords:

Brute force, Kriptografi, BLAKE2s, SHA3-512, Hash, Steganografi Video

Abstract

Perkembangan teknologi komputasi modern, seperti high-performance computing, cloud computing, dan GPU, telah meningkatkan kemampuan penyerang dalam melakukan serangan brute force terhadap sistem kriptografi. Penelitian ini bertujuan untuk menganalisis dan membandingkan ketahanan dua algoritma hash modern, yaitu BLAKE2s dan SHA3-512, terhadap serangan brute force dalam konteks pengamanan data berbasis steganografi video. Metode penelitian dilakukan melalui pengujian empiris dengan mengukur waktu cracking, hash rate, serta jumlah percobaan yang dibutuhkan untuk menemukan nilai hash. Hasil penelitian menunjukkan bahwa SHA3-512 memiliki ketahanan yang lebih tinggi dibandingkan BLAKE2s, dengan waktu cracking sebesar 511.479 detik, sementara BLAKE2s hanya membutuhkan 216.156 detik. Perbedaan ini dipengaruhi oleh hash rate BLAKE2s yang lebih tinggi, yaitu 1.350.846 H/s, dibandingkan SHA3-512 sebesar 570.881 H/s, sehingga mempercepat proses brute force. Meskipun demikian, waktu embedding kedua algoritma relatif sama, dengan selisih yang tidak signifikan. Jumlah percobaan brute force pada kedua algoritma juga identik, yaitu 291.993.781 percobaan, yang menunjukkan bahwa perbedaan ketahanan lebih dipengaruhi oleh efisiensi komputasi daripada kompleksitas ruang pencarian. Dengan demikian, SHA3-512 direkomendasikan sebagai algoritma hash yang lebih aman untuk melindungi data rahasia terhadap serangan brute force, meskipun memiliki performa yang lebih rendah dibandingkan BLAKE2s

References

J. Li, “Distributed data processing and task scheduling based on GPU parallel computing,” Neural Comput. Appl., vol. 37, no. 4, pp. 1757–1769, 2025.

B. Hanindhito, A. Fathi, D. Gourounas, D. Trenev, A. Gerstlauer, and L. K. John, “Technology trends in computing hardware and their impacts on high-performance scientific computing Part II: Memory systems, interconnects, and system integration,” Int. J. High Perform. Comput. Appl., p. 10943420251347460, 2026.

F. Lyu, Y. Kang, and S. Wang, “Converging high-performance computing and machine learning for geospatial discovery and innovation,” Ann. GIS, pp. 1–22, 2026.

F. Kurniawan, A. Muzakky, N. A. Mulyono, and A. F. Matondang, “Implementasi Teknik Hibrida Enkripsi Aes Dan Steganografi Multi-Platform Pada Aplikasi Berbasis Web’Steganoid’,” JIKUM J. Ilmu Komput., vol. 2, no. 2, pp. 184–189, 2026.

E. Fathalla and M. Azab, “Beyond classical cryptography: A systematic review of post-quantum hash-based signature schemes, security, and optimizations,” IEEE access, vol. 12, pp. 175969–175987, 2024.

A. Sarkar, S. R. Chatterjee, and M. Chakraborty, “Role of cryptography in network security,” in The" essence" of network security: an end-to-end panorama, Springer, 2020, pp. 103–143.

S. Shaik, “Optimizing Authenticated Encryption: Enhancements and Performance Analysis of ChaCha20 and Blake3 Algorithms,” in International Conference on Emerging Trends in Mathematical Sciences & Computing, 2024, pp. 181–193.

A. Sadeghi-Nasab and V. Rafe, “A comprehensive review of the security flaws of hashing algorithms,” J. Comput. Virol. Hacking Tech., vol. 19, no. 2, pp. 287–302, 2023.

R. Sujeetha, J. Aravida Raaja, P. Preeti Charishma, and H. Surya, “CipherHash: A Comprehensive and Secure Solution for Safeguarding Confidentiality and Protecting Sensitive Documents,” in International Conference on Innovations and Advances in Cognitive Systems, 2025, pp. 155–166.

K. Tran-Hoang and H. Nakajo, “Kyress: a secure, scalable, and resource-efficient CRYSTALS-Kyber cryptosystem for low-cost embedded devices,” J. Supercomput., vol. 82, no. 2, p. 101, 2026.

F. Li, X. Zhang, J. Feng, J. Ai, Z. Zilic, and J. Wang, “Efficient Hardware Architecture for the Kyber Public-Key Encryption Primitive,” IEEE Internet Things J., 2026.

R. A. Purba et al., Rekayasa Perangkat Lunak Berorientasi Objek: Teori dan Implementasi. Yayasan Kita Menulis, 2024.

S. Suryawanshi, D. Saha, and S. Sachan, “New results on the SymSum distinguisher on round-reduced SHA3,” in International Conference on Cryptology in Africa, 2020, pp. 132–151.

P. Peng and M. M. Moghimi, “Hash-based lightweight recommendation in edge computing for privacy-preserving sport communities,” J. Cloud Comput., vol. 15, no. 1, p. 7, 2026.

E. T. Ong et al., “THE 5E INQUIRY LEARNING MODEL: ITS EFFECT ON THE LEARNING OF ELECTRICITY AMONG MALAYSIAN STUDENTS,” J. Cakrawala Pendidik., vol. 40, no. 1, 2021.

D. ting Liu, B. yuan Cui, X. jun Dai, Z. qiong Zhang, and Y. ming Liu, “A comprehensive evaluation method for crowd-sourcing design work of product appearance integrating fractal dimension and hash algorithm,” Proc. Inst. Mech. Eng. Part B J. Eng. Manuf., p. 09544054261416164, 2024.

N. Mhatre and S. Bhattacharjee, “A Hash-Based Nature-Inspired Algorithm for High-Utility Itemset Mining,” in International Conference on Computing and Machine Learning, 2025, pp. 107–120.

A. Alshahrani, E. Jaha, and N. Alowidi, “Fusion of hash-based hard and soft biometrics for enhancing face image database search and retrieval,” Comput. Mater. Contin., vol. 77, no. 3, p. 3489, 2023.

R. A. Purba, “Application design to help predict market demand using the waterfall method,” Matrix J. Manaj. Teknol. dan Inform., vol. 11, no. 3, pp. 140–149, 2021.

R. Verma, N. Dhanda, and V. Nagar, “Enhancing security with in-depth analysis of brute-force attack on secure hashing algorithms,” in Proceedings of Trends in Electronics and Health Informatics: TEHI 2021, Springer, 2022, pp. 513–522.

P. Thavamani, B. T. H. Prasath, N. M. Rashed, R. V. Raman, E. N. Karthick, and K. Venkatesh, “Parallel brute-force decryption tool with grammar and structure validation for enhanced cryptographic cracking efficiency,” in Information and Communication Systems, CRC Press, 2026, pp. 25–31.

S. Pocarovsky, L. Kockovic, M. Orgon, and R. Róka, “Computational Efficiency of Brute-Force Attacks on Hashing Algorithms,” in Computer Science On-line Conference, 2025, pp. 402–413.