I LITERALLY bother with encryptions and bits in my job since I program in assembly! It would seem that it's you who doesn't understand. Brute force works by taking values incrementally and testing them out until you find the correct one. How much time do you think it takes for a top grade PC to do a "x+1" and test that as a seed to see if it works? It can do at least a few hundred of them per second depending on the encryption method, no matter how complicated and if you split the load between 30 of them, you are 30 times faster and more likely to find the key! (PC 1 takes 0-1M for example, PC 2 takes 1M+1 to 2M, etc. for example) One computer alone WILL take an unbelievably long time, but things don't work like they do on paper you know and if you use GPU calculations (eg: with CUDA C), you can cut down that "billion" or whatever to a decade and that's on a SINGLE computer. Proper optimization, both CPU and GPU doing the work and with 30 PCs, YES it is possible to do it in a month. What that page details is the general case of that encryption method, not the optimized one (eg: proper assignment of workload, proper memory management and optimization, values to skip [least likely ones like the very early ones] etc.). As I said, with proper optimization it can be done in LESS than a month if you know what you are doing and the only people who know how do it right don't care about Pokemon (military) or don't have the resources to spend.