Password strength

Password strength is a measure of the effectiveness of a password in resisting guessing and brute-force attacks. In its usual form, it estimates how many trials an attacker who does not have direct access to the password would need, on average, to guess it correctly. The strength of a password is a function of length, complexity, and unpredictability.[1]

Using strong passwords lowers overall risk of a security breach, but strong passwords do not replace the need for other effective security controls. The effectiveness of a password of a given strength is strongly determined by the design and implementation of the factors (knowledge, ownership, inherence). The first factor is the main focus in this article.

The rate at which an attacker can submit guessed passwords to the system is a key factor in determining system security. Some systems impose a time-out of several seconds after a small number (e.g. three) of failed password entry attempts. In the absence of other vulnerabilities, such systems can be effectively secured with relatively simple passwords. However the system must store information about the user passwords in some form and if that information is stolen, say by breaching system security, the user passwords can be at risk.

Password creation

Passwords are created either automatically (using randomizing equipment) or by a human; the latter case is more common. While the strength of randomly chosen passwords against a brute force attack can be calculated with precision, determining the strength of human-generated passwords is challenging.

Typically, humans are asked to choose a password, sometimes guided by suggestions or restricted by a set of rules, when creating a new account for a computer system or Internet Web site. Only rough estimates of strength are possible, since humans tend to follow patterns in such tasks, and those patterns can usually assist an attacker.[2] In addition, lists of commonly chosen passwords are widely available for use by password guessing programs. Such lists include the numerous online dictionaries for various human languages, breached databases of plaintext and hashed passwords from various online business and social accounts, along with other common passwords. All items in such lists are considered weak, as are passwords that are simple modifications of them. For some decades, investigations of passwords on multi-user computer systems have shown that 40% or more are readily guessed using only computer programs, and more can be found when information about a particular user is taken into account during the attack.

Password guess validation

Systems that use passwords for authentication must have some way to check any password entered to gain access. If the valid passwords are simply stored in a system file or database, an attacker who gains sufficient access to the system will obtain all user passwords, giving the attacker access to all accounts on the attacked system, and possibly other systems where users employ the same or similar passwords. One way to reduce this risk is to store only a cryptographic hash of each password instead of the password itself. Standard cryptographic hashes, such as the Secure Hash Algorithm (SHA) series, are very hard to reverse, so an attacker who gets hold of the hash value cannot directly recover the password. However, knowledge of the hash value lets the attacker quickly test guesses offline. Password cracking programs are widely available that will test a large number of trial passwords against a purloined cryptographic hash.

Improvements in computing technology keep increasing the rate at which guessed passwords can be tested. For example, in 2010, the Georgia Tech Research Institute developed a method of using GPGPU to crack passwords much faster.[3] Elcomsoft invented and started using common graphic cards for quicker password recovery in August 2007 and soon filed a corresponding patent in the US.[4] As of 2011, commercial products are available that claim the ability to test up to 2,800,000,000 passwords per second on a standard desktop computer using a high-end graphics processor.[5] Such a device can crack a 10 letter single-case password in one day. Note that the work can be distributed over many computers for an additional speedup proportional to the number of available computers with comparable GPUs. Special key stretching hashes are available that take a relatively long time to compute, reducing the rate at which guessing can take place. Although it is considered best practice to use key stretching, many common systems do not.

Another situation where quick guessing is possible is when the password is used to form a cryptographic key. In such cases, an attacker can quickly check to see if a guessed password successfully decodes encrypted data. For example, one commercial product claims to test 103,000 WPA PSK passwords per second.[6]

If a password system only stores the hash of the password, an attacker can pre-compute hash values for common passwords variants and for all passwords shorter than a certain length, allowing very rapid recovery of the password once its hash is obtained. Very long lists of pre-computed password hashes can be efficiently stored using rainbow tables. This method of attack can be foiled by storing a random value, called a cryptographic salt, along with the password. The salt is combined with the password when computing the hash, so an attacker precomputing a rainbow table would have to store for each password its hash with every possible salt value. This becomes infeasible if the salt has a big enough range, say a 32-bit number. Unfortunately, many authentication systems in common use do not employ salt and rainbow tables are available on the Internet for several such systems.

Entropy as a measure of password strength

It is usual in the computer industry to specify password strength in terms of information entropy, measured in bits, a concept from information theory. Instead of the number of guesses needed to find the password with certainty, the base-2 logarithm of that number is given, which is the number of "entropy bits" in a password. A password with, say, 42 bits of strength calculated in this way would be as strong as a string of 42 bits chosen randomly, say by a fair coin toss. Put another way, a password with 42 bits of strength would require 242 attempts to exhaust all possibilities during a brute force search. Thus, adding one bit of entropy to a password doubles the number of guesses required, which makes an attacker's task twice as difficult. On average, an attacker will have to try half of the possible passwords before finding the correct one.[2] Some in the field contend that entropy is a less than ideal way of looking at "strength" as it is in mathematical isolation from the actuality of user behaviour. Instead strength should be gauged by the randomness, as human generated randomness is predictable regardless of entropy.[7]

Random passwords

Random passwords consist of a string of symbols of specified length taken from some set of symbols using a random selection process in which each symbol is equally likely to be selected. The symbols can be individual characters from a character set (e.g., the ASCII character set), syllables designed to form pronounceable passwords, or even words from a word list (thus forming a passphrase).

The strength of random passwords depends on the actual entropy of the underlying number generator; however, these are often not truly random, but pseudo random. Many publicly available password generators use random number generators found in programming libraries that offer limited entropy. However most modern operating systems offer cryptographically strong random number generators that are suitable for password generation. It is also possible to use ordinary dice to generate random passwords. See stronger methods. Random password programs often have the ability to ensure that the resulting password complies with a local password policy; for instance, by always producing a mix of letters, numbers and special characters.

For passwords generated by a process that randomly selects a string of symbols of length, L, from a set of N possible symbols, the number of possible passwords can be found by raising the number of symbols to the power L, i.e. NL. Increasing either L or N will strengthen the generated password. The strength of a random password as measured by the information entropy is just the base-2 logarithm or log2 of the number of possible passwords, assuming each symbol in the password is produced independently. Thus a random password's information entropy, H, is given by the formula

H = \log_2 N^L = L\log_2 N = L {\log N \over \log 2}

where N is the number of possible symbols and L is the number of symbols in the password. H is measured in bits.[2][8] In the last expression, log can be to any base.

Entropy per symbol for different symbol sets
Symbol set Symbol count N Entropy per symbol H
Arabic numerals (0–9) (e.g. PIN) 10 3.322 bits
hexadecimal numerals (0–9, A-F) (e.g. WEP keys) 16 4.000 bits
Case insensitive Latin alphabet (a-z or A-Z) 26 4.700 bits
Case insensitive alphanumeric (a-z or A-Z, 0–9) 36 5.170 bits
Case sensitive Latin alphabet (a-z, A-Z) 52 5.700 bits
Case sensitive alphanumeric (a-z, A-Z, 0–9) 62 5.954 bits
All ASCII printable characters except space 94 6.555 bits
All ASCII printable characters 95 6.570 bits
All extended ASCII printable characters 218 7.768 bits
Binary (0-255 or 8 bits or 1 byte) 256 8.000 bits
Diceware word list 7776 12.925 bits

A binary byte is usually expressed using two hexadecimal characters.

To find the length, L, needed to achieve a desired strength H, with a password drawn randomly for a set of N symbols, one computes

L = {H \over \log_2 N}, rounded up to the next largest whole number.

The following table uses this formula to show the required lengths of truly randomly generated passwords to achieve desired password entropies for common symbol sets:

Lengths L of truly randomly generated passwords required to achieve a desired password entropy H for symbol sets containing N symbols.
Desired password entropy H Arabic numerals Hexadecimal Case insensitive Latin alphabet Case insensitive alphanumeric Case sensitive Latin alphabet Case sensitive alphanumeric All ASCII printable characters All extended ASCII printable characters Diceware word list
8 bits (1 byte) 3 2 2 2 2 2 2 2 1
32 bits (4 bytes) 10 8 7 7 6 6 5 5 3
40 bits (5 bytes) 13 10 9 8 8 7 7 6 4
64 bits (8 bytes) 20 16 14 13 12 11 10 9 5
80 bits (10 bytes) 25 20 18 16 15 14 13 11 7
96 bits (12 bytes) 29 24 21 19 17 17 15 13 8
128 bits (16 bytes) 39 32 28 25 23 22 20 17 10
160 bits (20 bytes) 49 40 35 31 29 27 25 21 13
192 bits (24 bytes) 58 48 41 38 34 33 30 25 15
224 bits (28 bytes) 68 56 48 44 40 38 35 29 18
256 bits (32 bytes) 78 64 55 50 45 43 39 33 20
384 bits (48 bytes) 116 96 82 75 68 65 59 50 30
512 bits (64 bytes) 155 128 109 100 90 86 78 66 40
1024 bits (128 bytes) 309 256 218 199 180 172 156 132 80

Human-generated passwords

People are notoriously poor at achieving sufficient entropy to produce satisfactory passwords. According to one study involving half a million users, the average password entropy was estimated at 40.54 bits.[9] Some stage magicians exploit this inability for amusement, in a minor way, by divining supposed random choices (of numbers, say) made by audience members.

Thus, in one analysis of over 3 million eight-character passwords, the letter "e" was used over 1.5 million times, while the letter "f" was used only 250,000 times. A uniform distribution would have had each character being used about 900,000 times. The most common number used is "1", whereas the most common letters are a, e, o, and r.[10]

Users rarely make full use of larger character sets in forming passwords. For example, hacking results obtained from a MySpace phishing scheme in 2006 revealed 34,000 passwords, of which only 8.3% used mixed case, numbers, and symbols.[11]

Note that the full strength associated with using the entire ASCII character set (numerals, mixed case letters and special characters) is only achieved if each character in the password is chosen randomly from that set. Capitalizing a letter and adding one or two numbers and a special character to a password will not achieve the same strength. If the numbers and special character are added in predictable ways, say at the beginning and end of the password,[12] they could even lower password strength compared to an all letter random password of the same length.

NIST Special Publication 800-63

NIST Special Publication 800-63 of June 2004 suggests the following scheme to roughly estimate the entropy of human-generated passwords:[2]

Using this scheme, an eight-character human-selected password without upper case letters and non-alphabetic characters is estimated to have 18 bits of entropy. The NIST publication concedes that at the time of development, little information was available on the real world selection of passwords.

Later research into human-selected password entropy using newly available real world data has demonstrated that the NIST scheme does not provide a valid metric for entropy estimation of human-selected passwords.[13]

Usability and implementation considerations

Because national keyboard implementations vary, not all 94 ASCII printable characters can be used everywhere. This can present a problem to an international traveler who wished to log into remote system using a keyboard on a local computer. See keyboard layout. Many hand held devices, such as tablet computers and smart phones, require complex shift sequences to enter special characters.

Authentication programs vary in which characters they allow in passwords. Some do not recognize case differences (e.g., the upper-case "E" is considered equivalent to the lower-case "e"), others prohibit some of the other symbols. In the past few decades, systems have permitted more characters in passwords, but limitations still exist. Systems also vary in the maximum length of passwords allowed.

As a practical matter, passwords must be both reasonable and functional for the end user as well as strong enough for the intended purpose. Passwords that are too difficult to remember may be forgotten and so are more likely to be written on paper, which some consider a security risk.[14] In contrast, others argue that forcing users to remember passwords without assistance can only accommodate weak passwords, and thus poses a greater security risk. According to Bruce Schneier, most people are good at securing their wallets or purses, which is a "great place" to store a written password.[15]

Required Bits of Entropy

The minimum number of bits of entropy needed for a password depends on the threat model for the given application. If key stretching is not used, passwords with more entropy are needed. RFC 4086, "Randomness Requirements for Security", presents some example threat models and how to calculate the entropy desired for each one.[16] Their answers vary between 29 bits of entropy needed if only online attacks are expected, and up to 128 bits of entropy needed for important cryptographic keys used in applications like encryption where the password or key needs to be secure for a long period of time and stretching isn't applicable. A 2010 Georgia Tech Research Institute study based on unstretched keys recommended a 12-character random password, but as a minimum length requirement.[3][17]

The upper end is related to the stringent requirements of choosing keys used in encryption. In 1999, an Electronic Frontier Foundation project broke 56-bit DES encryption in less than a day using specially designed hardware.[18] In 2002, distributed.net cracked a 64-bit key in 4 years, 9 months, and 23 days.[19] As of October 12, 2011, distributed.net estimates that cracking a 72-bit key using current hardware will take about 45,579 days or 124.8 years.[20] Due to currently understood limitations from fundamental physics, there is no expectation that any digital computer (or combination) will be capable of breaking 256-bit encryption via a brute-force attack.[21] Whether or not quantum computers will be able to do so in practice is still unknown, though theoretical analysis suggests such possibilities.[22]

Guidelines for strong passwords

Common guidelines

Guidelines for choosing good passwords are typically designed to make passwords less easily discovered by intelligent guessing. Common guidelines advocated by proponents of software system security include:[23][24][25][26][27]

Some guidelines advise against writing passwords down, while others, noting the large numbers of password protected systems users must access, encourage writing down passwords as long as the written password lists are kept in a safe place, not attached to a monitor or in an unlocked desk drawer.[28]

The possible character set for a password can be constrained by different web sites or by the range of keyboards on which the password must be entered.[29]

Examples of weak passwords

As with any security measure, passwords vary in effectiveness (i.e., strength); some are weaker than others. For example, the difference in weakness between a dictionary word and a word with obfuscation (i.e., letters in the password are substituted by, say, numbers — a common approach) may cost a password cracking device a few more seconds; this adds little strength. The examples below illustrate various ways weak passwords might be constructed, all of which are based on simple patterns which result in extremely low entropy, allowing them to be tested automatically at high speeds:[10]

There are many other ways a password can be weak,[31] corresponding to the strengths of various attack schemes; the core principle is that a password should have high entropy (usually taken to be equivalent to randomness) and not be readily derivable by any "clever" pattern, nor should passwords be mixed with information identifying the user. On-line services often provide a restore password function that a hacker can figure out and by doing so bypass a password. Choosing hard-to-guess restore password questions can further secure the password.[32]

Password policy

Main article: Password policy

A password policy is a guide to choosing satisfactory passwords. Some are controversial. They are usually intended to:

For example, password expiration is often covered by password policies. Password expiration serves two purposes:[33]

Some argue that password expirations have become obsolete,[34] since:

  • moving from never changing one's password to changing the password on every authenticate attempt (pass or fail attempts) only doubles the number of attempts the attacker must make on average before guessing the password in a brute force attack - one gains much more security just increasing the password length by one character than changing the password on every use.

Creating and handling passwords

The hardest passwords to crack, for a given length and character set, are random character strings; if long enough they resist brute force attacks (because there are many characters) and guessing attacks (due to high entropy). However, such passwords are typically the hardest to remember. The imposition of a requirement for such passwords in a password policy may encourage users to write them down, store them in PDAs or cellphones, or share them with others as a safeguard against memory failure. While some people consider each of these user resorts to increase security risks, others suggest the absurdity of expecting users to remember distinct complex passwords for each of the dozens of accounts they access. For example, security expert Bruce Schneier recommends writing down one's password:[35]

Simply, people can no longer remember passwords good enough to reliably defend against dictionary attacks, and are much more secure if they choose a password too complicated to remember and then write it down. We're all good at securing small pieces of paper. I recommend that people write their passwords down on a small piece of paper, and keep it with their other valuable small pieces of paper: in their wallet.

— Bruce Schneier, 2005

The following measures may increase acceptance of strong password requirements, if carefully used:

Memory techniques

Password policies sometimes suggest memory techniques to assist remembering passwords:

Protecting passwords

Computer users are generally advised to "never write down a password anywhere, no matter what" and "never use the same password for more than one account." However, an ordinary computer user may have dozens of password-protected accounts. Users with multiple accounts needing passwords often give up and use the same password for every account. When varied password complexity requirements prevent use of the same (memorable) scheme for producing high-strength passwords, oversimplified passwords will often be created to satisfy irritating and conflicting password requirements. A Microsoft expert was quoted as saying at a 2005 security conference: "I claim that password policy should say you should write down your password. I have 68 different passwords. If I am not allowed to write any of them down, guess what I am going to do? I am going to use the same password on every one of them."[42]

If passwords are written down, they should never be kept in obvious places such as address books, Rolodex files, under drawers or keyboards, or behind pictures. Perhaps the worst, but all too common, location is a Post-It note on the computer monitor. Better locations are a safe deposit box or a locked file approved for information of sensitivity comparable to that protected by the password. Most locks on office file cabinets are far from adequate. Software is available for popular hand-held computers that can store passwords for numerous accounts in encrypted form. Another approach is to encrypt by hand on paper and remember the encryption method and key.[43] And another approach is to use a single password or slightly varying passwords for low-security accounts and select distinctly separate strong passwords for a smaller number of high-value applications such as for online banking.

Another effective approach for remembering multiple passwords is to memorize a single "master" password and use software to generate a new password for each application, based on the master password and the application's name. This approach is used by Stanford's PwdHash.,[44] Princenton's Password Multiplier.[45] and other stateless password managers. In this approach, protecting the master password is essential, as all passwords are compromised if it is revealed.

Password managers

Main article: Password manager

A reasonable compromise for using large numbers of passwords is to record them in a password manager, which include stand-alone applications, web browser extensions, or a manager built into the operating system. A password manager allows the user to use hundreds of different passwords, and only have to remember a single password, the one which opens the encrypted password database. Needless to say, this single password should be strong and well-protected (not recorded anywhere). Most password managers can automatically create strong passwords using a cryptographically secure random password generator, as well as calculating the entropy of the generated password. A good password manager will provide resistance against attacks such as key logging, clipboard logging and various other memory spying techniques.

See also

References

  1. ↑ "Cyber Security Tip ST04-002". Choosing and Protecting Passwords. US CERT. Retrieved June 20, 2009.
  2. 1 2 3 4 "SP 800-63 - Electronic Authentication Guideline" (PDF). NIST. Retrieved April 20, 2014.
  3. 1 2 "Teraflop Troubles: The Power of Graphics Processing Units May Threaten the World's Password Security System". Georgia Tech Research Institute. Retrieved 2010-11-07.
  4. ↑ US patent 7929707, Andrey V. Belenko, "Use of graphics processors as parallel math co-processors for password recovery", issued 2011-04-19, assigned to Elcomsoft Co. Ltd.
  5. ↑ Elcomsoft.com, ElcomSoft Password Recovery Speed table, NTLM passwords, Nvidia Tesla S1070 GPU, accessed 2011-02-01
  6. ↑ Elcomsoft Wireless Security Auditor, HD5970 GPU accessed 2011-02-11
  7. ↑
  8. ↑ Schneier, B: Applied Cryptography, 2e, page 233 ff. John Wiley and Sons.
  9. ↑ Florencio, Dinei; Herley, Cormac (May 8, 2007). "A Large-Scale Study of Web Password Habits" (PDF). Proceeds of the International World Wide Web Conference Committee.
  10. 1 2 Burnett, Mark (2006). Kleiman, Dave, ed. Perfect Passwords. Rockland, Massachusetts: Syngress Publishing. p. 181. ISBN 1-59749-041-5.
  11. ↑ Bruce Schneier (December 14, 2006). "MySpace Passwords aren't so Dumb". Wired Magazine. Retrieved April 11, 2008.
  12. ↑ Microsoft.com
  13. ↑ Matt Weir, Susdhir Aggarwal, Michael Collins, Henry Stern. "Testing Metrics for Password Creation Policies by Attacking Large Sets of Revealed Passwords" (PDF). Retrieved March 21, 2012.
  14. ↑ A. Allan. "Passwords are Near the Breaking Point" (PDF). Gartner. Retrieved April 10, 2008.
  15. ↑ Bruce Schneier. "Schneier on Security". Write Down Your Password. Retrieved April 10, 2008.
  16. ↑ Randomness Requirements for Security. RFC 4086. https://tools.ietf.org/html/rfc4086.
  17. ↑ "Want to deter hackers? Make your password longer". MSNBC. 2010-08-19. Retrieved 2010-11-07.
  18. ↑ "EFF DES Cracker machine brings honesty to crypto debate". EFF. Retrieved March 27, 2008.
  19. ↑ "64-bit key project status". Distributed.net. Retrieved March 27, 2008.
  20. ↑ "72-bit key project status". Distributed.net. Retrieved October 12, 2011.
  21. ↑ Bruce Schneier. "Snakeoil: Warning Sign #5: Ridiculous key lengths". Retrieved March 27, 2008.
  22. ↑ "hash - Quantum Computing and Encryption Breaking". Stack Overflow. 2011-05-27. Retrieved 2013-03-17.
  23. ↑ Microsoft Corporation, Strong passwords: How to create and use them
  24. ↑ Bruce Schneier, Choosing Secure Passwords
  25. ↑ Google, Inc., How safe is your password?
  26. ↑ University of Maryland, Choosing a Good Password
  27. ↑ Bidwell, Teri (2002). Hack Proofing Your Identity in the Information Age. Syngress Publishing. ISBN 1-931836-51-5.
  28. ↑ schneier.com
  29. ↑ E.g., for a keyboard with only 17 nonalphanumeric characters, see one for a BlackBerry phone in an enlarged image in support of Sandy Berger, BlackBerry Tour 9630 (Verizon) Cell Phone Review, in Hardware Secrets (August 31, 2009), both as accessed January 19, 2010. That some websites don’t allow nonalphanumerics is indicated by Kanhef, Idiots, For Different Reasons (June 30, 2009) (topic post), as accessed January 20, 2010.
  30. ↑ "ComodoHacker responsible for DigiNotar Attack - Hacking News". Thehackernews.com. 2011-09-06. Retrieved 2013-03-17.
  31. ↑ Bidwell, p. 87
  32. ↑ "Guidelines for choosing a good password". Lockdown.co.uk. 2009-07-10. Retrieved 2013-03-17.
  33. ↑ "In Defense of Password Expiration". League of Professional Systems Administrators. Retrieved April 14, 2008.
  34. ↑ Eugene Spafford. "Security Myths and Passwords". The Center for Education and Research in Information Assurance and Security. Retrieved April 14, 2008.
  35. ↑ Schneier.com
  36. ↑ Mnemonic Devices (Indianapolis, Ind.: Bepko Learning Ctr., University College), as accessed January 19, 2010 Archived June 10, 2010 at the Wayback Machine
  37. ↑ Remembering Passwords (ChangingMinds.org), as accessed January 19, 2010
  38. ↑ Cipresso P, Gaggioli A, Serino S, Cipresso S, Riva G: How to Create Memorizable and Strong Passwords. J Med Internet Res 2012;14(1):e10; http://www.jmir.org/2012/1/e10/ DOI: 10.2196/jmir.1906 PMID 22233980
  39. ↑ http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3742392/
  40. ↑ https://blogs.dropbox.com/tech/2012/04/zxcvbn-realistic-password-strength-estimation/
  41. ↑ Anderson, Ross (2001). Security engineering: A guide to building dependable distributed systems. John Wiley & Sons, Inc. ISBN 0470068523.
  42. ↑ Microsoft security guru: Jot down your passwords, c\net Retrieved on 20016-02-02
  43. ↑ Simple methods (e.g., ROT13 and some other old ciphers) may suffice; for more sophisticated hand-methods see Bruce Schneier, The Solitaire Encryption Algorithm (May 26, 1999) (ver. 1.2), as accessed January 19, 2010, and Sam Siewert, Big Iron Lessons, Part 5: Introduction to Cryptography, From Egypt Through Enigma (IBM, July 26, 2005), as accessed January 19, 2010.
  44. ↑ Blake Ross; Collin Jackson; Nicholas Miyake; Dan Boneh; John C. Mitchell (2005). "Stronger Password Authentication Using Browser Extensions" (PDF). Proceedings of the 14th Usenix Security Symposium. USENIX. pp. 17–32.
  45. ↑ J. Alex Halderman; Brent Waters; Edward W. Felten (2005). A Convenient Method for Securely Managing Passwords (PDF). ACM. pp. 1–9.

External links

This article is issued from Wikipedia - version of the Wednesday, February 03, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.