01-11-2018, 08:05 AM
So I got it working with prince and it's working at it, but I realised it's not as efficient as it could be. I realised the structure of the password could be used here but I'm not too sure how.
The password is made up of 10-16 words and each word is used only once, from a predefined list, in order. So if we imagine a spreadsheet with 16 columns, the password would be composed of one word from each column. Each column would contain no more than 10-15 words each.
Would there be a way for me to implement this in hashcat as a rule, or alternatively generate an exhaustive list of candidates and then do a simple dictionary attack?
The password is made up of 10-16 words and each word is used only once, from a predefined list, in order. So if we imagine a spreadsheet with 16 columns, the password would be composed of one word from each column. Each column would contain no more than 10-15 words each.
Would there be a way for me to implement this in hashcat as a rule, or alternatively generate an exhaustive list of candidates and then do a simple dictionary attack?