Menghitung Peluang dalam Susunan Kata Sandi : Kombinatorika dalam Keamanan Digital

Arnah Ritonga; Dina Harianja; Maisarah Putri Lalyta Siregar; Stepanus Simatupang; Vany Aisah Panggabean

doi:10.62383/algoritma.v3i3.468

Authors

Arnah Ritonga Universitas Negeri Medan
Dina Harianja Universitas Negeri Medan
Maisarah Putri Lalyta Siregar Universitas Negeri Medan
Stepanus Simatupang Universitas Negeri Medan
Vany Aisah Panggabean Universitas Negeri Medan

DOI:

https://doi.org/10.62383/algoritma.v3i3.468

Keywords:

Brute-force, Combinatorics, Entropy, Password security, Probability

Abstract

Today is a sophisticated era where everything is digital, be it smartphones, laptops, even safes. So digital password security is essential in protecting personal data. This study analyzes password strength using combinatorics and probability. Calculations are made to determine the number of possible password combinations based on the length and type of characters. In addition, the probability of success of a brute-force attack is calculated based on the number of guesses that can be made by the attacker. The results show that the longer and more complex the password, the less likely it is to be guessed. This study also discusses the concept of information entropy to measure the level of randomness of passwords and its impact on digital security. This study provides insight into the importance of choosing strong passwords.

Downloads

Download data is not yet available.

References

Ahmad, E., Fahroza, M., Ramadhani, F., Syahfitri, A., & Fadhlurohhman, D. (2021). Implementasi kombinatorial dalam penentuan kata sandi teknologi. Jurnal Ilmu Komputer, Teknologi Informasi dan Teknik Telekomunikasi. https://doi.org/10.30596/JCOSITTE.V2I1.6526

Alghani, I. Y. (2019). Penggunaan teknik bruteforce untuk menentukan keamanan setiap kata sandi menggunakan metode kombinatorial. Unnes Journal of Mathematics, 8(2), 52–59.

Alkurdi, Y., Al-Fayoumi, M., Al-Badarneh, A., & Al-Haija, Q. (2023). Meningkatkan keamanan kata sandi melalui pembelajaran terbimbing. Konferensi Internasional tentang Teknologi Informasi (ICIT) 2023, 256–259. https://doi.org/10.1109/ICIT58056.2023.10226141

Bethapudi, P., Harika, T., Nirisha, G., & Prasanna, K. (2024). Sistem autentikasi kata sandi tiga tingkat. Jurnal Riset Internasional tentang Advanced Engineering Hub (IRJAEH). https://doi.org/10.47392/irjaeh.2024.0332

Esser, A., Girme, R., Mukherjee, A., & Sarkar, S. (2024). Memory-efficient attacks on small LWE keys. Journal of Cryptology, 37, 36. https://doi.org/10.1007/978-981-99-8730-6_3

George, G., & Thampi, S. (2022). Combinatorial analysis for securing IoT-assisted Industry 4.0 applications from vulnerability-based attacks. IEEE Transactions on Industrial Informatics, 18, 3–15. https://doi.org/10.1109/TII.2020.3045393

Gu, Y., Akao, S., Esfahani, N., Miao, Y., & Sakurai, K. (2022). Mengenai keamanan teori informasi dari transformasi kombinatorial all-or-nothing. IEEE Transactions on Information Theory, 68, 6904–6914. https://doi.org/10.1109/TIT.2022.3174008

Reaz, K., & Wunder, G. (2022). Entropi ekspektasi sebagai metrik kekuatan kata sandi. Konferensi IEEE 2022 tentang Komunikasi dan Keamanan Jaringan (CNS), 1–2. https://doi.org/10.1109/CNS56114.2022.9947259

Riznyk, V. (2022). Combinatorial optimization of systems of neural network cryptographic data protection. Ukrainian Journal of Information Technology. https://doi.org/10.23939/ujit2022.02.056

Wiese, M., & Boche, H. (2021). Mosaics of combinatorial designs for information-theoretic security. arXiv. https://arxiv.org/abs/2104.15009

Zaland, Z., Bazai, S., Marjan, S., & Ashraf, M. (2021). Algoritma keamanan kata sandi tiga tingkat untuk basis data daring. Konferensi Informatika dan Rekayasa Perangkat Lunak Internasional ke-2 (IISEC) 2021, 1–6. https://doi.org/10.1109/IISEC54230.2021.9672434