bruteforge 0.10_rc1, codename 512512

Almost rewritten to go faster, I've also changed his name into 'bruteforge', becouse now is smart enough to choose which char must be changed first and much more. Now it skip fast forward without restart the changing char to the first char if there are just n of that char.
Keep in mind that bruteforge doesn't break or crack nothing! Is a wordlist generator, so only prints out words!
Words can be acqua, acqua can be a password, like aababbcc can be a password, so aababbcc is a word.
Now, a simple bruteforce compute all combinations to reach the word acqua, 521743; bruteforge reach acqua in 512512.
There are rules that permits skips, and decrease the number of words printed out, useful when the target is having a less-weight of words to compute in your way.
Speed is not a problem, prints out about 13141 w/s on a Core2 Duo T7250; hosted on mz03.netfirms.com, ELF 32-bit binary

UPDATE: This was the old, no more mantained python version! Now bruteforge is entirely coded in C, check this one or here at right the blog archive to know more!

bruteforce is evolving

Added alphabet selection from lowercase alpha, numeric only, lowercase alpha + numeric, esadecimal, the 32 character set and custom. Now the main loop analyze and change the selected char(s) until it founds a valid one and prints it out, then return the loop.
Added a new algorithm based on some discussion on forums about sequences of four numbers in group of six, but the third algorithm is the good stuff. Looks like 'if there are n equal chars, don't try again that char, until one of those change', and n is a new customizable option!

p4-clockmod: 'too long latency for HW'

if you get the 'too long latency for HW' message and it fallback into performance governor when you want to switch into ondemand or others this helps you. developers has intenctionally disabled this, but if you can compile kernel by yourself just change the value of latency 10000001 to 1000000 in arch/x86/kernel/cpu/cpufreq/p4-clockmod.c and recompile. here the snip

- policy->cpuinfo.transition_latency = 1000000; /* assumed */
+
+ /* the transition latency is set to be 1 higher than the maximum
+ * transition latency of the ondemand governor */
+ policy->cpuinfo.transition_latency = 10000001;

lowercharset proof of concept

A normal bruteforce like crunch compute all 521743 combinations to found the word 'acqua', mine uses one algorithm to skip unprobable combinations and do the job with 502118. Based on bruteforce 0.01 alpha written by Tony Bhimani.