Unfortunately most of my points are about redundancy rather than cool speed tips, but removing clutter generally helps improve speed anyway (not massively, but enough). This leads on to multi-threading, which is the fastest way to accelerate the problem, but I am not sure this is available on your browser.
and, that's a somewhat fruitless problem, because even halving the time would not be meaningful in most cases. So, you are left with just making the current system faster. which would be counter-intuitive to check a bunch of 8-char passwords before you check all 7 char passwords. Using recursion would be a natural way to solve the general problem of checking all solutions, but it has the problem that it checks all solutions in the wrong order (typically it solves the longest passwords first. This is one of the joys about brute-force tactics, by the way, is that, in general, the fastest way to crack a brute-force password of reasonable length, is to do nothing. Note, I would not expect even the fastest PC to be able to get to 5char passwords using a single-threaded execution model, in the most optimal way, to check more than 1,000,000 passwords a second, which makes 5 char passwords more than 2 minutes away. so, the right way to crack this password this millennium, is to actually wait about 20 years, and then crack it then when computers are a few hundred times faster -) Now, your browser, if it is on an amazing PC, will be 1000 times slower. about 5 weeks (not 2.5 years as originally stated). It will need 3,000,000 seconds to get to the right one.
Now, let's assume your browser is super fast (like in the scale of a super-computer), and can compute 1 billion passwords each second. That means you will have to calculate about. OK, so, let's assume the person chooses an 8 char password you need to crack, and that it starts about half-way through your alphabet with a 'K'. So, there are the following possible permutations for passwords: 1 char -> 95 Your algorithm is an incrementing index, which you then convert in to the radix of your charset.
0 kommentar(er)
