Posts: 1

Threads: 1

Joined: Jul 2020

Hello

I am new to hashcat and cant figure out how to make a mask for the following:

min char: 11

max char: 11

on every position the char could be [A-Z] and [0-9].

Maybe some one can show me the way.

THANK YOU

Posts: 2,267

Threads: 16

Joined: Feb 2013

first of all it's infeasible to brute-force (and in most cases also mask attack) a hash with a password that is very long and random. It's mathematically imposiible. NOT doable. just do the math (hint: it involves the total cracking speed in H/s and the total keyspace).

to answer your question:

Code:

`hashcat -m 0 -a 3 --custom-charset2 ?u?d -w 3 -O hash.txt ?2?2?2?2?2?2?2?2?2?2?2`

Posts: 930

Threads: 4

Joined: Jan 2015

Hint for calculating total keyspace:

https://www.wolframalpha.com/input/?i=%2...10%29%5E11
Divide this by your actual attack speed in hashes per second. For example, if your speed is 200M H/s, here is how many days it will take to exhaust that mask:

https://www.wolframalpha.com/input/?i=%2...0*60*24%29
~