I reckon this is a relatively simple explanation & demo of how simple it is to crack passwords if you have access to both a database dump of salted passwords, p

I reckon this is a relatively simple explanation & demo of how simple it is to crack passwords if you have access to both a database dump of salted passwords, provided the password itself is relatively easily guessable (present in some dictionary of candidate passwords). In terms of performance -- > At the moment, it processes 100K attempts in about 2 minutes on a small VPS. It is a bit hard to compare performance without knowing what the `hashloop` parameter was set to for each attempt for that benchmark. Assuming that the hashloop parameter is set to `8192` aka `(1 << strings.Index(itoa64, "B"))` as in the blog post, then this approach is computing about 6.83 md5 mega-hashes (MH) / sec. For a 30,000x speedup for brute forcing md5: hashcat + 8x GPUs can hit something like 200 GH / sec of md5: https://hashcat.net/hashcat/ https://hashcat.net/hashcat/ https://gist.github.com/epixoip/a83d38f412b4737e99bbef804a270c40 https://gist.github.com/epixoip/a83d38f412b4737e99bbef804a27...