Added the complexity checker from the paper. There are a few minor adjustments from the paper. We are assuming that the charset is constant. Same with the amount of substrings in a charset. The other thing is with searching. We are searching for the whole string in the list of common passwords instead of substrings in a dictionary. We can change that to be the substrings and searching through it but i am putting this up for the time being.
Added the complexity checker from the paper. There are a few minor adjustments from the paper. We are assuming that the charset is constant. Same with the amount of substrings in a charset. The other thing is with searching. We are searching for the whole string in the list of common passwords instead of substrings in a dictionary. We can change that to be the substrings and searching through it but i am putting this up for the time being.