11-25-2015, 01:37 AM
(11-19-2015, 12:16 PM)atom Wrote:Quote:Using just the provided rules, I was able to crack: Jump in the fire!
Using just the provided rules, I was NOT able to crack: Never not learning!
I guess the "!" char was not part of the password, in that case the second one is > length 16 which is not supported for some of the algorithms. See here for details: https://hashcat.net/wiki/doku.php?id=fre...ord_length
Thanks for responding Atom. The "!" was indeed part of each password, as were the spaces. Further, some of the passwords that were in a similar vein used leet-speak style transcoding, e.g., 2 for to or too, 3 for E, 4 for A, etc., resulting in passphrases that were long (the longest cracked was length 22) and complex (upper, lower, digits and symbols). At this point, I can only figure that these long phrases were cracked using a generate or generate2 rule (at least if I'm understanding correctly how these rules work... I'm still very new!).
I'm aware of some of the length limitations and think I have a grasp on the reasons for the limitations. What keeps nagging at me is that there must be a way to use probability (maybe not strictly Markov, but a statistical approach) and human nature to get at some of the longer passphrases.
So much to learn! I really appreciate and any all advice. Thank you.