(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

(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

(08-24-2023, 10:32 AM)Snoopy Wrote: first i made a typo (two ?? in row which is wrong) in maskfile line 5, this should be the problem with the attack when reaching this line
second, what kind of hash to you try to attack? attackspeed is also very dependend on the targethash
your passwordstyle  with 3 4 5 is cracked within seconds (md5) even on plain cpu (i tried it right now)
5 is exhausted in ~ 30 seconds

(08-25-2023, 03:23 AM)ly88888 Wrote:

(08-24-2023, 10:32 AM)Snoopy Wrote: first i made a typo (two ?? in row which is wrong) in maskfile line 5, this should be the problem with the attack when reaching this line
second, what kind of hash to you try to attack? attackspeed is also very dependend on the targethash
your passwordstyle  with 3 4 5 is cracked within seconds (md5) even on plain cpu (i tried it right now)
5 is exhausted in ~ 30 seconds

My test is md5 encryption, and the length of 5 digits I mentioned is not the total length of the plaintext password, but rather the 5 bits of the preceding portion. In other words, the total length is 5+1+5

mask
?l,?1?1?1?1?15

rule
fD6

In this case, we only need to crack 5 digits, not 11, so he should complete it quickly