CrackStation.net's Lookup TablesA Python Implementation of
There are three components to this system:
The indexing script
createidx.py, which takes a wordlist and builds a lookup table index for a hash function and the words in the list.
The indexing sorter program
sortidx.c, which sorts an index created by the indexing script, so that the lookup script can use a binary search on the index to crack hashes.
The lookup script
hashlookup.py, which uses the wordlist and index to crack hashes.
Indexing a Dictionary
Suppose you have a password dictionary in the file
words.txt and you would
like to index it for MD5 and SHA1 cracking.
First, create the MD5 and SHA1 indexes:
$ ./createidx.py -a md5 -w words.txt $ ./createidx.py -a sha1 -w words.txt
Next, build the sortidx program and run it on the indexes.
$ make $ ./sortidx -r 1024 words-md5.idx $ ./sortidx -r 1024 words-sha256.idx
The -r parameter is the maximum amount of memory sortidx is allowed to use in Mb. The more memory you let it use, the faster it will go.
Once you have generated and sorted the index, you can use the LookupTable class to crack hashes. It can be used as a library or a standalone app.
$ ./hashlookup.py -a md5 -i words-md5.idx -w words.txt -c 1f3870be274f6c49b3e31a0c6728957f
Once a wordlist has been indexed, you can not modify the wordlist file without breaking the indexes. Appending to the wordlist is safe in that it will not break the indexes, but the words you append (obviously) won't be indexed, unless you re-generate the index.
There is currently no way to add words to an index without re-generating the entire index.