Limiting the consecutive occurrence

[Hash-IT]

Another update to this. I have been trying to generate a dictionary using this method and it is so slow I don't think it is a viable option.

M@lik do you have any suggestions ? I read the thread you linked to today regarding just random guesses and atom seemed to like it. I hope this interest can be extended to this idea also. I like to think of it as pseudo brute force or at least an educated guess !!

In your example above

Quote:mp64 ?u?u?u?u?u?u?u?u | sed '/\([A-Z]\)\1\1/d'
AABAABAA
AABAABAB
AABAABAC
AABAABAD
AABAABAE
AABAABAF
AABAABAG

I can see that you have 8 characters, when I try to do the same I can leave my computer for many hours and nothing is generated. Although when I do 6 characters I get results. Could there be an issue where the windows based version cannot handle >7 characters ?

Edit..

I have a little more information on this last >7 problem. I can actually make 8 characters but if I use less than \1\1\1 nothing happens for hours. I guess the filter is incredibly slow or there is something wrong as your example has only \1\1 !!!

Another update....

If and I mean a big if I have my calculations correct..and I am more than open to the possibility I don't, but just assuming the best case, I think if we had this feature or pre-prepared dictionaries an attack on a wpa of 8 upper alpha only should be reduced by about 18%.

That's pretty significant I think !