Via YARGB are some interesting password recovery times based upon password content, length and type of computing resources one has.
I remember back in college (in the early 90s) we had access to a MasPar with, I think, 4,096 processing nodes. There was talk of writing a password cracking program for the machine, which was a perfect use for the machine, being a SIMD architecture (same program on each processing node, but different data). The default Unix password scheme (at the time) used a 12 bit number to “randomize” the password, so there could be 4,096 different encryption results for any given password. A perfect fit for the MasPar—instead of having to do 4,096 serial encryptions of a guess, all 4,096 possible values could be tested at once. An incredible increase in speed (it could do in an hour what it would take a conventional computer about 24 days to do).
But alas, we never got around to it; I'm suspect it was because no one really wanted to program in FORTRAN.
Obligatory Contact Info
You have my permission to link freely to any entry here. Go
ahead, I won't bite. I promise.
The dates are the permanent links to that day's entries (or
entry, if there is only one entry). The titles are the permanent
links to that entry only. The format for the links are
simple: Start with the base link for this site: https://boston.conman.org/, then add the date you are
interested in, say 2000/08/01,
so that would make the final URL:
You can also specify the entire month by leaving off the day
portion. You can even select an arbitrary portion of time.
You may also note subtle shading of the links and that's
intentional: the “closer” the link is (relative to the
page) the “brighter” it appears. It's an experiment in
using color shading to denote the distance a link is from here. If
you don't notice it, don't worry; it's not all that
It is assumed that every brand name, slogan, corporate name,
symbol, design element, et cetera mentioned in these pages is a
protected and/or trademarked entity, the sole property of its
owner(s), and acknowledgement of this status is implied.