07-26-2023, 04:19 PM
first of all, forget the idea of one mask, you cannot tell hashcat all the things you mentioned in one mask (a mask is not a regex)
next thing is you can only combine 4 custom charsets (when you try to reflect your rule with your not near keys) you could take a look at https://github.com/hashcat/kwprocessor maybe it is possbile to use this for reflecting non near keys
never the less, lets do some math here, i used your example, for generating a plain, not modified mask like this
mask = ?l?d?u?l?d?l?d?l?u?d
combinations = 3.089.157.760.000, given 130kh/s -> 275 days ETA
trying to reflect non near keys very simple like skipping one vertical line (german keyboardlayyout) so: qay edc tgb ujm
or just imagine splitting the 26 chars 50/50 lets say ?l ?u are not 26 each but just 13 each, this will result in
combinations = 48.268.090.000 -> ETA 4.3 days
but this is just one mask, you have to generate all possbile masks for this kind of approach and the 13 chars instead of 26 is thought very simple
lets take a look at char "q", chars near are "was" so possible chars are still 22 and how do you specify "near" when taking a closer look at your keyboard
d -> ersfxc is w near or not?
f -> ertdgcv is e near or not?
mutating your given pass could be done with rules, but same problem, you will have to gerate huge amounts of rules to reflect all your mentioned possiblities
so yeah, my opinion: forget this and enjoy your life
next thing is you can only combine 4 custom charsets (when you try to reflect your rule with your not near keys) you could take a look at https://github.com/hashcat/kwprocessor maybe it is possbile to use this for reflecting non near keys
never the less, lets do some math here, i used your example, for generating a plain, not modified mask like this
mask = ?l?d?u?l?d?l?d?l?u?d
combinations = 3.089.157.760.000, given 130kh/s -> 275 days ETA
trying to reflect non near keys very simple like skipping one vertical line (german keyboardlayyout) so: qay edc tgb ujm
or just imagine splitting the 26 chars 50/50 lets say ?l ?u are not 26 each but just 13 each, this will result in
combinations = 48.268.090.000 -> ETA 4.3 days
but this is just one mask, you have to generate all possbile masks for this kind of approach and the 13 chars instead of 26 is thought very simple
lets take a look at char "q", chars near are "was" so possible chars are still 22 and how do you specify "near" when taking a closer look at your keyboard
d -> ersfxc is w near or not?
f -> ertdgcv is e near or not?
mutating your given pass could be done with rules, but same problem, you will have to gerate huge amounts of rules to reflect all your mentioned possiblities
so yeah, my opinion: forget this and enjoy your life