//Description
This project focuses on optimizing password cracking strategies through the implementation of a Binary Search Tree (BST) approach. By organizing
passwords based on 3 criteria, the goal is to enhance the efficiency
of cracking process. This project aims to develop a more effective and targeted method for
password cracking than brute forcing, but is not used for malicious intent and only emphasizes
the use of a data structure and serves as a side project.
Using the BST approach, the password cracking
process uses prioritizes passwords based on strength, hashed passwords, and frequency of use,
enabling a targeted and efficient search to increase the likelihood of
successfully cracking common and stronger passwords, increasing the likelihood of gaining
access.
//Here is a link to the code
//Features
-
The project utilizes the Binary Search Tree (BST) approach
for password cracking which creates a neat, ranking data structure that allows for efficient
search, removal, and addition of new passwords
-
Narrows down the search space and comparison operations for faster password
retrieval by efficiently dividing the search space into smaller
subsets, reducing the number of comparisons needed to find the target password
-
Clear visualization of each password's rank
based on the comparison criteria, effectively organizing them from the worst to the
best.
-
Enables easy insertion of new passwords , even ensuring their
seamless integration into the ranking system.
//Some images of examples below:
