![]() |
hashcat mask with No 2 identical adjacent characters - Printable Version +- hashcat Forum (https://hashcat.net/forum) +-- Forum: Support (https://hashcat.net/forum/forum-3.html) +--- Forum: hashcat-utils, maskprocessor, statsprocessor, md5stress, wikistrip (https://hashcat.net/forum/forum-28.html) +--- Thread: hashcat mask with No 2 identical adjacent characters (/thread-11344.html) |
hashcat mask with No 2 identical adjacent characters - moda20 - 03-12-2023 Hello, a newbie here and i am trying to trim the mask i am using to crack a hash, knowing that there is not 2 adjacent characters that are identical. considerring i am using this mask : -1 ?l?d ?1?1?1?1?1?1?1?1 which is for lowercase alphanumeric characters, is there a way to create the rule of no 2 identical adjacent characters or do i need to create a wordlist ? RE: hashcat mask with No 2 identical adjacent characters - Snoopy - 03-13-2023 (03-12-2023, 11:43 PM)moda20 Wrote: Hello, a newbie here and i am trying to trim the mask i am using to crack a hash, knowing that there is not 2 adjacent characters that are identical. short answer no there is no rule for that, anyway depending on your hashalgorithm, any logic for sorting out like this will mostly slow down the whole cracking task to a point where testing these extra candidates will be faster so no, you will have to create a wordlist or just run the full mask |