(depending on your hash and attack speed) true random stringsĀ or english words?
okay this is a nice one, the best thing is to combine bruteforce with rules (there are possibilities to tune this attack a little bit more but for a fast run)
the maskfile is with lower chars only, add ?u before the first comma for upper and lower letters
masks.txt
rules.txt
hashcat --stdout -a3 masks.txt | hashcat --status -myourmode -O -r rules.txt yourhashfile
what it does:
it generates strings starting from length1 with added numbers, the output is taken as input for hashcat, with added rules for reflecting and deleting positions 1/2 up to 9/10
here we could tune this attack, but then we need to start runs for each length seperalty and with only the specific rule needed, as i said depending on speed this would be an option for longer strings (1-4 or 1-6 or even 1-8 should be fast enough even when using 9 instead of one rule
okay this is a nice one, the best thing is to combine bruteforce with rules (there are possibilities to tune this attack a little bit more but for a fast run)
the maskfile is with lower chars only, add ?u before the first comma for upper and lower letters
masks.txt
Code:
?l,?1?d
?l,?1?1?d
?l,?1?1?1?d
?l,?1?1?1?1?d
?l,?1?1?1??1?1d
?l,?1?1?1?1?1?1?d
?l,?1?1?1?1?1?1?1?d
?l,?1?1?1?1?1?1?1?1?d
rules.txt
Code:
fD1
fD2
fD3
fD4
fD5
fD6
fD7
fD8
fD9
hashcat --stdout -a3 masks.txt | hashcat --status -myourmode -O -r rules.txt yourhashfile
what it does:
it generates strings starting from length1 with added numbers, the output is taken as input for hashcat, with added rules for reflecting and deleting positions 1/2 up to 9/10
here we could tune this attack, but then we need to start runs for each length seperalty and with only the specific rule needed, as i said depending on speed this would be an option for longer strings (1-4 or 1-6 or even 1-8 should be fast enough even when using 9 instead of one rule