22May
John the Ripper / Hashcat rule, reject candidate if char at position X is the same as character at position Y
I'm using John to generate some word lists and I'm trying to figure out the most optimized way to do the next step. What I want to do is add ever possible 3 digit number to a set where the first digit of the number is not the same as the first digit in the set
Set example 123ABC
to add
+ 213 = 123ABC213 OK
+ 131 = 123ABC131 REJECT
I see rules that reject unless a string includes, but not a comparison function like this.
I could make the whole list and prune it after with a python script, but it would be way bigger than needed.
Thank you!
