(12-10-2019, 11:56 PM)undeath Wrote: ok, so there are 4*36 possibilities per hash. That's perfectly doable, but you should write a small script instead of using hashcat for that. hashcat can't utilise its parallelisation well with that few candidates.Thank you, sounds like we're getting closer to finding a solution, but how do I do that? Remember that I'm an absolute noob at this and I have no experience whatsoever with this software or any kind of scripting (and I do wish to learn because there are similar yet different hashes that I must deal with). I do not intent to be a burden or an annoyance, it's just that I really need to deal with those hashes to help people. Thank you.
If you really want to do that with hashcat you could implement it using a single-word dict and a generated rule file for the x/y placeholders but that would probably be slower than a script because you'd have to deal with hashcat's comparably slow startup time for every single hash.
(PS: In this example, there might be only a few possibilities. But otherwise in reality, the possibilities are
aaaaabbcdwxyz/aaaaaeeedwxyz/aaaaabbcdwxyz
where aaaaa, bb and eee are known, and c, d, w,x,y,z are unknown and to be found.
c is either U, E or S.
d is 99% of the time a number but it can also be a letter.
w is either A, B, C, D, E, F or Z.
x is R or a bigger letter.
y can be any letter from A to L.
z is alphanumeric.
The same letter means that the exact same characters are used)