Please use the new version instead.
This program computes a good set of mutation rules for John the Ripper for cracking a givent password list with a given dictionary, using predefined rules as a template. It uses a greedy algorithm to compute the best append/prepend rules that could be used in conjunction with the predefined rules.
You must edit the following parameters in the Makefile :
It is highly recommended you adjust the MAXMEM parameter in ra.c and slimmer.c to match the maximum memory you wish to use (defaults are for a 16GB machine, with 4 parallel threads : 14.5GiB for ra and 4GiB for slimmer). If this doesn't make any sense to you, just use a computer with 16GB of memory.
A sample is provided for your enjoyment in the rules subdirectory. Each file must contain a single John the Ripper mutation rule. In order to properly exploit this tool you will have to add better base rules.