Editing 936: Password Strength

{{comic
| number    = 936
| date      = August 10, 2011
| title     = Password Strength
| image     = password strength.png
| titletext = To anyone who understands information theory and security and is in an infuriating argument with someone who does not (possibly involving mixed case), I sincerely apologize.
}}

==Explanation==
Computer security consultant Mark Burnett has posted a [http://xato.net/passwords/analyzing-the-xkcd-comic/ discussion and analysis] of this comic on his blog.

This comic is saying that the password in the top frames "Tr0ub4dor&3" is easier for password cracking software to guess because it has less entropy than "correcthorsebatterystaple" and also more difficult for a human to remember, leading to insecure practices like writing the password down on a post-it attached to the monitor.

In simple cases the {{w|Entropy (information theory)|entropy}} of a password is calculated as ''a^b'' where ''a'' is the number of allowed symbols and ''b'' is its length. A dictionary word (however long) has an entropy of around 65000, i.e. 16 bits. A truly random string of length 11 (not like "Tr0ub4dor&3", but more like "J4I/tyJ&Acy") has 94^11 = 72.1 bits. However the comic shows that "Tr0ub4dor&3" has only 28 bits of entropy. Another way of selecting a password is to have 2048 "symbols" (common words) and select only 4 of those symbols. 2048^11 = 44 bits, much better than 28.

It is absolutely true that people make passwords hard to remember because they think they are "safer", and it is certainly true that length, all other things being equal, tends to make for very strong passwords and this can confirmed by using [http://rumkin.com/tools/password/passchk.php rumkin.com's password strength checker]. Even if the individual characters are all limited to [a-z], the exponent implied in "we added another lowercase character, so multiply by 26 again" tends to dominate the results.

In addition to being easier to remember, long strings of lowercase characters are also easier to type on smartphones and {{w|Virtual keyboard|soft keyboards}}.

xkcd's password generation scheme requires the user to have a list of 2048 common words (log<sub>2</sub>2(2048) = 11). For any attack we must assume that the attacker knows our password generation algorithm, but not the exact password. In this case the attacker knows the 2048 words, and knows that we selected 4 words, but not which words. The number of combinations of 4 words from this list of words is 2<sup>11</sup>&times;4 = 44 bits. For comparison, the [http://world.std.com/~reinhold/dicewarefaq.html#calculatingentropy entropy offered by Diceware's 7776 word list is 13 bits per word]. If the attacker doesn't know the algorithm used, and only knows that lowercase letters are selected, the "common words" password would take even longer to crack than depicted. 25 ''random'' lowercase characters would have [http://www.wolframalpha.com/input/?i=log2%2826^25%29 117 bits of entropy], vs 44 bits for the common words list.

{{w|Steve Gibson (computer programmer)|Steve Gibson}} from the {{w|Security Now}} podcast did a lot of work in this arena and found that the password <code>D0g.....................</code> (24 characters long) is stronger than <code>PrXyc.N(n4k77#L!eVdAfp9</code> (23 characters long) because both have at least one uppercase letter, lowercase letter, number, and "special" character, so length trumps perceived complexity. Steve Gibson makes this very clear in his password haystack [https://www.grc.com/haystack.htm reference guide and tester]:
:"Once an exhaustive password search begins, '''the most important factor''' is password length!"

The important thing to take away from this comic is that longer passwords are better because each additional character adds much more time to the breaking of the password. That's what [[Randall]] is trying to get through here. Complexity does not matter unless you have length in passwords. Complexity is more difficult for humans to remember, but length is not.

;Example
Below there is a detailed example which shows how different rules of complexity work to generate a password with supposed 44 bits of entropy. The examples of expected passwords were generated in random.org.(*)

If ''n'' is the number of symbols and ''L'' is the length of the password, then ''L'' = 44 / log<sub><small>2</small></sub>(n).

{|class="wikitable"
!Symbols
!Number of symbols
!Minimum length
!colspan="2"|Examples of expected passwords
!Example of an actual password
!Actual bits of entropy
!Comment
|-
|a||26||9.3||mdniclapwz||jxtvesveiv||troubadorx||16+4.7 = 20.7||Extra letter to meet length requirement; log<sub><small>2</small></sub>(26) = 4.7
|-
|rowspan="2"|a 9
|rowspan="2"|36
|rowspan="2"|8.5
|rowspan="2"|qih7cbrmd
|rowspan="2"|ewpltiayq
|tr0ub4d0r||16+3=19||3 = common substitutions in the comic
|-
|troubador1||16+3.3=19.3||log<sub><small>2</small></sub>(10) = 3.3
|-
|a A||52||7.7||jAwwBYne||NeTvgcrq||Troubador||16+1=17||1 = caps? in the comic
|-
|a &amp;||58||7.5||j.h?nv),||c/~/fg\:||troubador&amp;||16+4=20||4 = punctuation in the comic
|-
|a A 9||62||7.3||cDe8CgAf||RONygLMi||Tr0ub4d0r||16+1+3=20||1 = caps?; 3 = common substitutions
|-
|a 9 &amp;||68||7.2||_@~"#^.2||un$l&amp;#7c;!f]||tr0ub4d0r&amp;||16+3+4=23||3 = common substitutions; 4 = punctuation
|-
|a A 9 &amp;||94||6.7||Re-:aRo||^$rV{3?||Tr0ub4d0r&||16+1+3+4=24||1 = caps?; 3 = common substitutions; 4 = punctuation
|-
|rowspan="2"|common words
|rowspan="2"|2048
|rowspan="2"|4
|rowspan="2"|reasonable&#8203;retail&#8203;sometimes&#8203;possibly
|rowspan="2"|constant&#8203;yield&#8203;specify&#8203;priority||reasonable&#8203;retail&#8203;sometimes&#8203;possibly||11&times;4=44||Go to random.org and select 4 random integers between 1 and 2048; then go to your list of common words 
|-
|correct&#8203;horse&#8203;battery&#8203;staple
|0
|Because of this comic this password has no entropy
|}

:a = lowercase letters
:A = uppercase letters
:9 = digits
:&amp; = the 32 special characters in an American keyboard; Randall assumes only the 16 most common characters are used in practice (4 bits)

:(*)&nbsp;The use of random.org explains why <code>jAwwBYne</code> has two consecutive w's, why <code>Re-:aRo</code> has two R's, why <code>_@~"#^.2</code> has no letters, why <code>ewpltiayq</code> has no numbers, etc. A human would have attempted at passwords that looked random.

==Transcript==
:The comic illustrates the relative strength of passwords assuming basic knowledge of the system used to generate them.
:A set of boxes is used to indicate how many bits of entropy a section of the password provides.
:The comic is laid out with 6 panels arranged in a 3x2 grid.
:On each row, the first panel explains the breakdown of a password, the second panel shows how long it would take for a computer to guess, and the third panel provides an example scene showing someone trying to remember the password.

:[The password "Tr0ub4dor&3" is shown in the center of the panel. A line from each annotation indicates the word section the comment applies to.]

:Uncommon (non-gibberish) base word
:[Highlighting the base word - 16 bits of entropy.]
:Caps?
:[Highlighting the first letter - 1 bit of entropy.]
:Common Substitutions
:[Highlighting the letters 'a' (substituted by '4') and both 'o's (the first of which is substituted by '0') - 3 bits of entropy.]
:Punctuation
:[Highlighting the symbol appended to the word - 4 bits of entropy.]
:Numeral
:[Highlighting the number appended to the word - 3 bits of entropy.]
:Order unknown
:[Highlighting the appended characters - 1 bit of entropy.]
:(You can add a few more bits to account for the fact that this is only one of a few common formats.)

:~28 bits of entropy 
:2<sup>28</sup> = 3 days at 1000 guesses sec
:(Plausible attack on a weak remote web service. Yes, cracking a stolen hash is faster, but it's not what the average user should worry about.)
:Difficulty to guess: Easy.

:[Cueball stands scratching his head trying to remember the password.]
:Cueball: Was it trombone? No, Troubador. And one of the O's was a zero?
:Cueball: And there was some symbol...
:Difficulty to remember: Hard.

:[The passphrase "correct horse battery staple" is shown in the center of the panel.]
:Four random common words {Each word has 11 bits of entropy.}

:~44 bits of entropy
:2<sup>44</sup> = 550 years at 1000 guesses sec
:Difficulty to guess: Hard.

:[Cueball is thinking, in his thought bubble a horse is standing to one side talking to an off-screen observer. An arrow points to a staple attached to the side of a battery.]
:Horse: That's a battery staple.
:Observer: Correct!
:Difficulty to remember: You've already memorized it

:Through 20 years of effort, we've successfully trained everyone to use passwords that are hard for humans to remember, but easy for computers to guess.

==External links==
*Some info was used from the highest voted answer given to the question of "how accurate is this XKCD comic" at StackExchange [http://security.stackexchange.com/questions/6095/xkcd-936-short-complex-password-or-long-dictionary-passphrase].
*Similarly, a question of "how right this comic is" was made at AskMetaFilter [http://ask.metafilter.com/193052/Oh-Randall-you-do-confound-me-so] and [[Randall]] responded [http://ask.metafilter.com/193052/Oh-Randall-you-do-confound-me-so#2779020 there].
*Also the Wikipedia article on '{{w|Passphrase}}' is useful.
*In case you missed it in the explanation, GRC's Steve Gibson has a fantastic page [https://www.grc.com/haystack.htm] about this (and may have prompted this comic, as his podcast [http://www.grc.com/sn/sn-303.htm] about this was posted the month before this comic).

{{comic discussion}}
[[Category:Comics featuring Cueball]]
[[Category:Math]]
[[Category:Computers]]