[66146] in Cypherpunks
Evolving algorithm for faster brute force key searches?
daemon@ATHENA.MIT.EDU (jack)
Sun Sep 22 16:11:45 1996
Date: Fri, 05 Jul 1996 16:01:53 -0400
From: jack <thecrow@iconn.net>
To: coderpunks@toad.com
Cc: cypherpunks@toad.com
I got an idea last night, maybe this has already been thought of and
tried, but I thought I would give a quick outline of the program I was
thinking of:
-Specify a maximum key size (assume 1024bits or something)
-Start with an arbitrary key "aaaaaaaaaaaaaa"
Start a loop
-create five mutations of the key
-use each key to try and decrypt a few bytes of the message
-run a (or some) statistical analysis tests and come up with a value
for how 'random' the decrypted bits are
-Pick the key that produced the least random ouput
Repeat
Probably this wouldnt work on any very strong algorithm, but it seems it
might be effective against some. I am going to write the code and try
it out on RC4 and on a weakling little algorithm I wrote a while back.
Let me know what yall think.
