In article <
1kpx977.k51qemdcthyoN%%steve%@malloc.co.uk>, Steve Firth
<%
steve%@malloc.co.uk> writes
>Richard Clayton <
ric...@highwayman.com> wrote:
>
>> assuming a dictionary of 20K words then selecting 4 words from it would
>> give a space of around 16E16, taking 10 characters each from a set of 64
>> is around 1E18 ... ie your example doesn't show any such trumping by a
>> factor of 6 in the wrong direction !
>
>I am tempted to reply "mindless literalist" to that one.
>
>What on earth makes you think that the dictionary has 20K words?
because you suggested the words chosen would make passwords that "are
somewhat more memorable" that tends to mean words from a working
vocabulary
> The OED
>has over 200K words. Secondly what makes you think that every password
>would contain four words?
because that's the example you gave (I took the ten letters you gave for
the other style as well)
>And thirdly what makes you think I am
>advocating four correctly spelled dictionary words?
because that's the example you gave
> I'm simply stating
>that long passwords drawn from the set [A-Z,a-z,0-9]
dictionary words don't contain 0-9 and you were only capitalising the
first letter...
> trump short
>passwords drawn from the set [A-Z,a-z,0-9,@�$%^&*].
that is of course entirely true (for suitable values of long and
short)... but that's not what you gave examples of :(
>Within that space
>one may make the password memorable if one wishes. If one wishes to use
>the [CVC]n format preferred by some users instead of dictionary words,
>one may. An attacker does not therefore have the comfort of knowing that
>the password must be a specific number of dictionary words.
>
>Also of course any password system should react to brute force attempts,
>and time out if there is a clear attempt to brute force a password. An
>attacker should not be able to get as far as 10E16 attempts, not even as
>far as 10E2 attempts in any external attack.
again I refer you to Joseph's work -- who makes this point very clearly
indeed... and gives some nice graphs derived from real password
datasets; including the largest studied so far (captured in an elegant
privacy preserving manner from Yahoo! users)
> Your concerns are valid
I don't have concerns about complexity ... it's pretty much a red
herring here -- my main concern was that people do the calculations on
the "word" system correctly
we now generally point at
http://xkcd.com/936/ (that uses just a 2000
word dictionary -- and the sum is correctly done to give ~2E13)
>if
>the attacker has stolen the password hash file, and the salts and users
>invariably use a limited number of dictionary words. (I hope Gradwell
>salted passwords *before* they came up with their ludicrous policy,
>otherwise there's an element of PKB in their approach).
>
>So, I would argue that the 21 char password that I referred to is a
>member of a password space of 4E37 members and has an entropy of 125
>bits that would (usually) be downrated to 105 bits if user selected
>dictionary words are used.
I would argue that the space is considerably smaller than 4E37 in
practice if the memorable test is applied (and there's a strong
suspicion that users of the multiple word system go for sequences that
have some grammatical quirks)
remember how the well-trained user of Enigma could not resist selecting
L E R "at random" if the three letters they were given were H I T!
>That's about twice as effective as anyone
>really needs to use, especially if combined with sensible other controls
>such as restricting the number of failed attempts before lockout.
see Joseph's work for a suitable computation -- and some new
formalisations of how to practically model attackers.
also, fans of rules like "use a non-letter and some caps etc" might care
to do some more reading:
http://cups.cs.cmu.edu/rshay/pubs/passwords_and_people2011.pdf
which paper continues to emphasise my main point which is that the
recent changes by the once-cluefull Gradwell are not evidence based (at
least no evidence from the past couple of decades) and are more likely
to be counterproductive than useful :-(