complicated mask_attack or brute force?
#3
or split, prepare a dict with 6 positions numbers from 000000 to 999999 use this dict twice in combinator attack and combine this with a rule file where you also add all rules possible

Overwrite @ N oNX Overwrite character at position N* with X
* Indicates that N starts at 0. For character positions other than 0-9 use A-Z (A=10)

starting with
o0A
o1A
...
oBA
oCA
...
..
oCZ (last)

do this for all Chars from A-Z (there is a thread where you can use maskprocessor oder hahscat to do this for you, im in a hurry, so i cant give you the link)

rules are amplifiers so it should be faster than the pure bruteforce aproach (will test it tomorrow and give you some data on this)
Reply


Messages In This Thread
RE: complicated mask_attack or brute force? - by Snoopy - 10-06-2021, 07:35 PM