Recently I found myself coming across numerous WPA-PSK encrypted wireless APs, with a desire to access them. I think it’s safe to say we all know about the WPA CoWPAtty tables, but these APs did not have names that were in the tables. To make matters worse, at the time the only available hardware I had available was my netbook, and I was attempting ~280 keys a second. With my massive dictionaries with millions and millions of real-world passwords to attempt, it was going to take hours for each AP.

I decided I needed to order my password dictionaries in a manner that would bring the more likely passwords to the beginning, and the least likely passwords to the end. I wasn’t aware of any program that did this, and figured I would write my own.

A few hundred lines of C later and I have a very fast password dictionary ordering program. It is far from perfect, but much better than nothing. It loads the entire dictionary into memory, creates all the information necessary for markov chains, and then uses this information to score each individual password. The passwords are then ordered by their score.

You can find the code in the rainbowsandpwnies googlecode svn repo.