08-19-2023, 03:22 AM
(08-18-2023, 04:43 PM)ly88888 Wrote:(08-18-2023, 04:33 PM)Snoopy Wrote: (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
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
Thank you for your reply, I'm learning and need some time
Thank you for providing the code. Perhaps my translation is not accurate and I didn't fully understand your message. After testing with md5, the cracking speed is still very slow, and even the first 5 (?l?d) portion takes about an hour to crack. Is there a better way to crack it? After all, only the first part is unknown, and the rest is equivalent to some plaintext password. This speed is normal if only the first part is cracked.