Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

How does that math work?


The bits, I'm assuming a list of about 2k-4k words. The XKCD example is 2k, so 11 bits per word.

The guesses per second, I looked up some hashcat benchmarks to get a rough range.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: