1993-08-20 - Genetic Algorithms and password cracking

Header Data

From: an31122@anon.penet.fi
To: cypherpunks@toad.com
Message Hash: 6e4df715a78a7fca6b680148b6bb966442a823fb0fe86d513f80f5ef9c4d77ea
Message ID: <9308201332.AA27968@anon.penet.fi>
Reply To: N/A
UTC Datetime: 1993-08-20 13:36:33 UTC
Raw Date: Fri, 20 Aug 93 06:36:33 PDT

Raw message

From: an31122@anon.penet.fi
Date: Fri, 20 Aug 93 06:36:33 PDT
To: cypherpunks@toad.com
Subject: Genetic Algorithms and password cracking
Message-ID: <9308201332.AA27968@anon.penet.fi>
MIME-Version: 1.0
Content-Type: text/plain



Hi,
	If my understanding of GAs is correct (not a given), they operate
by progressively narrowing the search space until they arrive at the
solution.  More clearly, each generation uses information gleaned from 
previous generations to guide the current search.  The operation depends
on being able to take two sets of input parameters and decide which
operates better than the other.  I'm not a cryptographer, so I don't
know whether there is a way to find out if an answer is "close" to the
actual.  If not, GAs will probably be of little use.

-------------------------------------------------------------------------
To find out more about the anon service, send mail to help@anon.penet.fi.
Due to the double-blind, any mail replies to this message will be anonymized,
and an anonymous id will be allocated automatically. You have been warned.
Please report any problems, inappropriate use etc. to admin@anon.penet.fi.





Thread