Some rules for mask_attack

[mastercracker]

You will have to enumerate all masks one by one for each length in a mask file (.hcmask). It will take time to make that file but after it should be quick to crack since the maximum keyspace that you will have to cover is 6 (10 minus 4 for the bN and Jh). Examples for the mask file:

len7
bNJh?1?1?1
bN?1Jh?1?1
bN?1?1Jh?1
...
len10
bNjH?1?1?1?1?1?1
...
?1?1?1bN?1?1jH?1
...

EDIT: Ok. I don't know what speed you will have for this algo so it might not be that quick but it's definitely feasible.