3.0 out of 3 for correctly implementing the two-argument form of crack
1.9 out of 2 for "good" guesses
1.0 out of 1 for code quality
0.5 out of 1 for build quality
3.0 out of 3 for passing the Diffie-Hellman challenge response
5.0 out of 5 for discovering passwords
Marker comments:
Good readability and modularisation, Well commented code, Consistent indentation
Statistics are calculated using Stats_common_password.ipynb (python jupyter notebook)
- 82 % are alphabets
- 11 % are alphanumeric
- 5 % are numbers
- Passwords comprises of 70 different character
- 99% of passwords dont contain special characters
- 85% of passwords contain either 0 or 1 numbers
- 99% of passwords do not contain uppercase
- only 2% of words contain consecutive character
- numbers character probability sorted in descending order - 1,2,0,9,3,4,5,6,7,8
- 99% of passwords do not contain uppercase
- In most cases, uppercase are in the first few characters
Flow of the program for 1 argument (Generate passwords)
-
Try dictionary attack, spit out words from common_passwords.txt
- 3 cases:
- word length = 6 (nice, just print out)
- word length > 6 (slice word so word length = 6 and print)
- word length < 6 (digit padding, based on distribution of numbers)
- 3 cases:
-
Smart generation of password will be based on:
- 6 character, split into alphabets (82%), alphanumeric(11%) and numeric passwords (5%)
- How it works:
- statisics of each character for each index is calculated
- based on the statistics, it is randomly generated.
- run "make clean" - to remove all binary files and executables
- run "make" - to create executable files
- run "./crack NUMBEROFGUESSTOGENERATE" OR "./crack GUESSFILE HASHFILE"