![]() ![]() You won't get these kinds of hash rates if you don't write your code in a way to maximize the GPU. To your specific question, note that it does matter how you implement this. For brute force on random strings, longer is much more powerful than complicated. On the other hand, adding just 3 more lowercase-letters (9 total) gets you to 26^9 ~ 5.4T. It's a tiny space.Īdding uppercase, numbers and the easily typed symbols gets you up to 96^6 ~ 780B. , but all of these together only raises this to around 320M hashes. Note that in many cases a 6 character string can also be a 5 character string, so you need to add 26^6 + 26^5 + 26^4 +. You don't even need a particularly fancy GPU for something on this scale. ![]() That said, given you're 50% likely to find the answer in the first half of your search, it's so fast to crack that you might not even bother unless you were doing this often. Yes, but a lowercase-latin 6 character string is also short enough that you would expect to compute this one time and put it into a database so that you could look it up in O(1). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |