🚀 go-pugleaf

In article <1992Jul27.184324.14697@hubcap.clemson.edu> hubcap@hubcap.clemson.edu (System Janitor) writes:
>Even dropping the time consuming crypt part, it seems like it would
>take an unacceptable amount of time to change your password if it were 
>checked against, say, an 800,000 word dictionary with 300 transmogrification 
>rulesets.

We do it here.  We:

1. Run a *huge* dictionary against all of crack's Mangles.  (A simple C
   wrapper around crack_lib does the trick.)

2. Strip every mangle output to 8 bytes maximum.

3. Sort -u this monster.  (It helps to have a 2-processor Solbourne 5e with
   256MB of physical memory and a GB of /tmp space.  :)

Currently the file looks like this:

-rw-r--r--  1 nickless 107137306 Jul 12 20:40 bigdict.sorted

You then do a binary search against this.  The search probe scans for the 
first full word near the computed byte address.  Once you narrow it down 
to about 100 bytes then a simple linear search happens.

Written in perl, with the bigdict.sorted file mounted via NFS, it only takes 
about 5-10 seconds max to do the lookup and decide whether the password is 
secure enough.
---
Bill Nickless  System Support Group  <nickless@mcs.anl.gov>  +1 708 252 7390