Help with ruleset

[KaliMane]

Hi guys, I have a 20k WPA to crack and the password consists of 8 Uppercase letters and 2 digits. Both at any possible position within those 10.


How would I define the ruleset for that scenario to be most efficient?


smth like

-1 ?d?u ?u?u?u?u?u?u?u?u?d?d

Would be wrong due to the fact that I define their respective positions, which I dont know though. (?)

 

[174region174]

The simplest solution is to ask the neural network to create a set of masks that will meet your requirements.
But I think your search will take a huge amount of time anyway. you won't want to look for that password yourself.

 

[KaliMane]

Fair point, yea I figured it would take a while no matter how I spin it as theres a huge amount of combinations even with those rules. yikes

 

[pasnger57]

Hi guys, I have a 20k WPA to crack and the password consists of 8 Uppercase letters and 2 digits. Both at any possible position within those 10.


How would I define the ruleset for that scenario to be most efficient?


smth like

-1 ?d?u ?u?u?u?u?u?u?u?u?d?d

Would be wrong due to the fact that I define their respective positions, which I dont know though. (?)

... you have 20K (twenty thousand) WPA2 handshakes > ?....... all Consisting of -1 ?d?u ?u?u?u?u?u?u?u?u?d?d Mask ? ( is this my understanding correctly)
This woud be a SUPER project that woud take a Team of rigs working it for a good some time to crack may be a 1/10 of 20k in wpa2 (probably more like 1/%)

 

[pasnger57]

it woud be Feasible in some cases with a Hashtopolis

 

[Dawbs]

I think someone is mis-comprehending the size of this task.

Doing some quick math with lots of rounding up/down (so give/take a few numbers)

With this as the base mask - ?u?u?u?u?u?u?u?u?d?d and moving the 2 digits to every possible position will result in 45 combinations.

Using a 4090 as an example card and a hashrate of around 2500kH/s, each single run will take about 100 days

1 card = 100x45=4500 days (12 years)
2 cards = 6 years
4 cards = 3 years
6 cards = 2 years
12 cards = 1 year

Obviously this doesn't take into account getting the crack early which is likely going on known statistics & probabilities but still........

 

[KaliMane]

I think someone is mis-comprehending the size of this task.

Doing some quick math with lots of rounding up/down (so give/take a few numbers)

With this as the base mask - ?u?u?u?u?u?u?u?u?d?d and moving the 2 digits to every possible position will result in 45 combinations.

Using a 4090 as an example card and a hashrate of around 2500kH/s, each single run will take about 100 days

1 card = 100x45=4500 days (12 years)
2 cards = 6 years
4 cards = 3 years
6 cards = 2 years
12 cards = 1 year

Obviously this doesn't take into account getting the crack early which is likely going on known statistics & probabilities but still........

Yes, correct. Its probably more than Id be willing to invest resource wise, so Ill likely skip it. As mentioned above I could generate all combos with a script, but those would be 26^8 *100 combos. yikesss.


@poster above: No I meant 22k as in hash mode 22000.

 

[KaliMane]

Thanks everybody for the input. Might throw this one to into the unrealized projects bin