PASSWORD STRENGTH STUDY USING THE ZXCVBN ALGORITHM AND BRUTE-FORCE TIME ESTIMATION TO STRENGTHEN CYBERSECURITY

This research analyzes password strength based on its length and complexity using brute force attack simulations. The study begins with collecting password data from various sources to ensure sufficient variation in complexity levels. Next, the passwords are evaluated using the Zxcvbn algorithm, which provides a strength score as well as information about the time required to crack them. The same passwords are also evaluated using Brute-force Time Estimation to calculate the estimated time required to crack the password. After both algorithms have been evaluated, the results are analyzed to find the correlation between the Zxcvbn score and the estimated brute force time. The results of the data analysis are then visualized in the form of graphs or diagrams to facilitate understanding and assessment of password security. This simulation estimates the time required to guess a password, depending on the level of password complexity. Although the simulation results show that long and complex passwords are more secure, the actual strength of the password is highly dependent on the tools used by the attacker. In addition, digital security is not only limited to passwords, but also depends on various loopholes that can be exploited, such as personal data leaks or software vulnerabilities. Therefore, a comprehensive security approach is essential to protect users from potential cyberattacks. This study aims to provide in-depth insights into the strength and vulnerability of passwords and the effectiveness of algorithms in assessing password security.

Authors

Institutions

Publication Details

Journal
Jurnal Pilar Nusa Mandiri
Published
2025-03-14
DOI
https://doi.org/10.33480/pilar.v21i1.6119
Primary Topic
Computer Science and Engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PASSWORD STRENGTH STUDY USING THE ZXCVBN ALGORITHM AND BRUTE-FORCE TIME ESTIMATION TO STRENGTHEN CYBERSECURITY

Didit Suhartono, Haris Junianto, Sugiarti Sugiarti, Whisnu Yudha Saputra
Jurnal Pilar Nusa Mandiri
Computer Science and Engineering
article

PASSWORD STRENGTH STUDY USING THE ZXCVBN ALGORITHM AND BRUTE-FORCE TIME ESTIMATION TO STRENGTHEN CYBERSECURITY

Didit Suhartono, Haris Junianto, Sugiarti Sugiarti, Whisnu Yudha Saputra
article en

Abstract

This research analyzes password strength based on its length and complexity using brute force attack simulations. The study begins with collecting password data from various sources to ensure sufficient variation in complexity levels. Next, the passwords are evaluated using the Zxcvbn algorithm, which provides a strength score as well as information about the time required to crack them. The same passwords are also evaluated using Brute-force Time Estimation to calculate the estimated time required to crack the password. After both algorithms have been evaluated, the results are analyzed to find the correlation between the Zxcvbn score and the estimated brute force time. The results of the data analysis are then visualized in the form of graphs or diagrams to facilitate understanding and assessment of password security. This simulation estimates the time required to guess a password, depending on the level of password complexity. Although the simulation results show that long and complex passwords are more secure, the actual strength of the password is highly dependent on the tools used by the attacker. In addition, digital security is not only limited to passwords, but also depends on various loopholes that can be exploited, such as personal data leaks or software vulnerabilities. Therefore, a comprehensive security approach is essential to protect users from potential cyberattacks. This study aims to provide in-depth insights into the strength and vulnerability of passwords and the effectiveness of algorithms in assessing password security.

Jurnal Pilar Nusa MandiriVol. 21(1)
Universitas Wijayakusuma Purwokerto (ID)
Openalex Percentile: Top 98%
Computer Science and Engineering
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.