Joined: Feb. 2007
||Posted: Jan. 13 2008,17:52
Here's my current one, I know nothing of perl, but still edited it :^)
If I got this right, the substr function replaces the position where we are going with the next one in the set. I limited the set, but before going to wait a lifetime, I'd like to implement the filtering.
my $n = 30; # max len of passphrase
my @set = ( "ä", "ö", "y", "a" .. "p", "r" .. "v" ); # ranges and lists to permute
system("echo $result | 2>/dev/null openssl rsa -noout -text -passin stdin -in mykey && echo -n 'Found passphrase: ' && echo $result && kill 0");
Oh, with the SIGnalling I meant that since it goes faster if it doesn't print every tried option, if I wanted to know where it's going before it has finished, I'd send it a SIGUSR1 and it would print the current $result and continue guessing.
Is perl really this light? Top shows only 1% cpu usage with this, and my system feels faster than using compiled C variants.
Well, back to the filtering.
I assume this part should be changed to something like this:
if $result=*aaa* then continue
There's no such thing as life. Those mean little jocks invented it ;)
Windows is not a virus. A virus does something!