[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <CANWtx03D2HHNDBB+qwbYwQHUcvk8xwExwT4jC0EFXUQeEpAr7Q@mail.gmail.com>
Date: Sun, 22 Nov 2015 21:34:54 -0500
From: Rich Rumble <richrumble@...il.com>
To: john-users@...ts.openwall.com
Subject: Aggressive password policy math
I reference and use the http://openwall.info/wiki/john/policy (Effect
of password policies on keyspace reduction) page all the time. I'm
unsure how to do the math in some aggressive policies I've seen in
other's networks.
I don't know C or Python so I'm unsure, and I can't math, so I'm
unsure how to alter the values in the code provided on the page to
compute the outcomes.
Here are two I've seen:
---Policy-1---
Pass-min=8
Alpha-min=2 (makes the next rules redundant)
Upper-min=1
Lower-min=1
Must-not=$ (can't have this character at all) (makes this 94 vs 95 possible)
No-repeat-chr=2 (case insensitive, hHh, TTt won't work)
Policy-2
Pass-min=8
Alpha-min=2 (makes the next rules semi redundant)
Upper-min=1
Lower-min=1
No-reapeat-chr=1 (case-sensitive, Aa will work!)
Weird policies and weird software enforcing them :)
Obviously it's the weird repeating patterns that are the most
troublesome for me.
-rich
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.
