Limiting the consecutive occurrence

[Hash-IT]

Yes, I'll help generate. Which do you want me to do?

Edit:

I tried the first command "/\(.\)\1/d;/\(.\).*\1.*\1/d" as it seems the most relaxed of the two against a known WPA key which is HSSBFXLI and it striped it out, so I guess one would have to relax the command more or use rules to get this.

Yikes ! Thats a shame our first known password fails with the new method.

Ok first thing is how come you have already managed to find that out ? I set my computer going just after posting the code above and I have yet to see anything in the output file !!!! Is my computer "pants" or are you running a mega beast ?

To catch the "SS" part of your password you need to modify the code a little to the quoted below.

Code:

"/\(.\)\1\1/d;/\(.\).*\1.*\1/d"

You can change all the code provided before by using find and replace.

It might be an idea to hold fire on us all generating these lists until we decide how far to optimise them. We should talk more about it first.

I would also very much like to know what is wrong with my computer and why is it so slow compared to yours !!!!

---

This is an interesting thread, I have been trying to learn bits and bobs about the
correct use of sed in wordlist manipulations as it is a very powerful (yet complicated)
tool in this respect.

Will be following it closely

Laters - TAPE

Thank you very much for taking the time to read this Tape, I appreciate it.

I think once this is worked out it would be great if you can do one of your detailed write ups, I do enjoy reading your blogs, especially when it involves hashcat !

Do you have any statistics or ideas that may help reduce a brute force attack ? My main idea (until Pixel proved it to be weak) was to have 1 consecutive occurrence and up to 2 instances in a given line. This may have to be widened now after Pixels observation to 2 consecutive occurrences and up to 2 instances per line.

I look forward to reading your ideas.