masterzorag's Activity

Monday, October 26, 2009

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!

Friday, October 9, 2009

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;

Tuesday, October 6, 2009

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.