Hi everybody--
We're about to move a 3.0 system from base security to enhanced and would
like to use the optional pwpolicy hooks offered by the system.
Basically, I'd just like to have a fast program that does the following:
Check the password against a static list of words
Check for username permutations (forwards, backwards, etc)
I know the triviality checks will use spell to check the password, but I
want something that could perhaps work more efficiently with a enormous list
of words (e.g., several dictionaries with several permutations of each word).
Has anybody out there written such a beast already? While this shouldn't
take long to write from scratch, I don't want to reinvent the wheel if
I don't have to.
Thanks,
jonathan
--
+++ Jonathan Rozes, Unix Systems Administrator, Tufts University
++ jrozes_at_tcs.tufts.edu, http://rozes.tcs.tufts.edu/
+ Ultimately, thinking is a very inefficient method of processing
data.... [Surfing the Himalayas, 0-312-14147-5]
Received on Tue Apr 02 1996 - 21:30:36 NZST