[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <a82a919e0702211239n204761aekca0792f6e6c8097a@mail.gmail.com>
Date: Wed, 21 Feb 2007 20:39:40 +0000
From: "Larry Bonner" <larry.bonner1@...il.com>
To: john-users@...ts.openwall.com
Subject: Optimized DES Crypt implementations
Hi all
i'm doing a short assignment for school on password algorithms/crackers and
am looking for information on fast crypt implementations right now.
john the ripper is fastest program i could find to do this but there are no
design notes, (as to how or why it is best at cracking, for example DES
crypt())
what flaws exist in the crypt() or other algorithms, that can be exploited
to crack passwords faster..??
any existing papers out there on this?
thanks all for any feedback
larry
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
