2WIREXXX Improvement about pskracker

[soxrok2212]

Hi! Thanks for your suggestion. By default, Hashcat uses "Markov-chain like optimizations". This means that it will automatically try more likely candidates such as 0193847263 before it tries 0222333887.

FWIW, on two stock 1080 Ti, you can run the entire 10^10 keyspace in a max of roughly 2.5 hours, which, on pure bruteforce, would take 1 hour 15 mins on a statistical average. In practice, you will see even shorter than that with Markov enabled.

Given that Hashcat already implements a more advanced approach of this, I feel like it would be wasteful and would add more overhead and would be best to let Hashcat do the work. It appears that the script you wrote is from ~5 years ago, so during that time it would've been effective since Hashcat didn't get use optimizations, it was just a straight, incremental bruteforce. Let me know if you have any other questions or concerns (or if you have something that might make me consider otherwise to add this feature).

Source: https://hashcat.net/wiki/doku.php?id=frequently_asked_questions#i_want_to_optimize_my_brute-force_attack_by_ordering_letters_by_frequency_in_a_custom_charset_how_to_do_it_does_it_make_sense

[initiate6]

Duh!, yeah, you are right :D I don't think it would be worth it. Back in the day it was awesome. I forgot about how the Markov chains would work in this scenario and it would be a lot faster.