Password cracking

In cryptanalysis and computer security, password cracking is the process of recovering passwords[1] from data that has been stored in or transmitted by a computer system. A common approach (brute-force attack) is to repeatedly try guesses for the password and to check them against an available cryptographic hash of the password.[2]

The purpose of password cracking might be to help a user recover a forgotten password (installing an entirely new password is less of a security risk, but it involves System Administration privileges), to gain unauthorized access to a system, or to act as a preventive measure whereby system administrators check for easily crackable passwords. On a file-by-file basis, password cracking is utilized to gain access to digital evidence to which a judge has allowed access, when a particular file's permissions are restricted.

Time needed for password searchesEdit

The time to crack a password is related to bit strength (see password strength), which is a measure of the password's entropy, and the details of how the password is stored. Most methods of password cracking require the computer to produce many candidate passwords, each of which is checked. One example is brute-force cracking, in which a computer tries every possible key or password until it succeeds. With multiple processors, this time can be optimized through searching from the last possible group of symbols and the beginning at the same time, with other processors being placed to search through a designated selection of possible passwords.[3] More common methods of password cracking, such as dictionary attacks, pattern checking, word list substitution, etc. attempt to reduce the number of trials required and will usually be attempted before brute force. Higher password bit strength exponentially increases the number of candidate passwords that must be checked, on average, to recover the password and reduces the likelihood that the password will be found in any cracking dictionary.[4]

The ability to crack passwords using computer programs is also a function of the number of possible passwords per second which can be checked. If a hash of the target password is available to the attacker, this number can be in the billions or trillions per second, since an offline attack is possible. If not, the rate depends on whether the authentication software limits how often a password can be tried, either by time delays, CAPTCHAs, or forced lockouts after some number of failed attempts. 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 some kinds of password hash, ordinary desktop computers can test over a hundred million passwords per second using password cracking tools running on a general purpose CPU and billions of passwords per second using GPU-based password cracking tools[1][5][6] (See: John the Ripper benchmarks).[7] The rate of password guessing depends heavily on the cryptographic function used by the system to generate password hashes. A suitable password hashing function, such as bcrypt, is many orders of magnitude better than a naive function like simple MD5 or SHA. A user-selected eight-character password with numbers, mixed case, and symbols, with commonly selected passwords and other dictionary matches filtered out, reaches an estimated 30-bit strength, according to NIST. 230 is only one billion permutations[8] and would be cracked in seconds if the hashing function is naive. When ordinary desktop computers are combined in a cracking effort, as can be done with botnets, the capabilities of password cracking are considerably extended. In 2002, successfully found a 64-bit RC5 key in four years, in an effort which included over 300,000 different computers at various times, and which generated an average of over 12 billion keys per second.[9]

Graphics processors can speed up password cracking by a factor of 50 to 100 over general purpose computers for specific hashing algorithms. As of 2011, available commercial products claim the ability to test up to 2,800,000,000 passwords a second on a standard desktop computer using a high-end graphics processor.[10] Such a device can crack a 10 letter single-case password in one day. The work can be distributed over many computers for an additional speedup proportional to the number of available computers with comparable GPUs.[citation needed]. However some algorithms are or even are specifically designed to run slow on GPUs. Examples include (triple) DES, bcrypt , scrypt and Argon2.

The emergence of hardware acceleration over the past decade GPU resources to be used to increase the efficiency and speed of a brute force attack for most hashing algorithms. In 2012, Stricture Consulting Group unveiled a 25-GPU cluster that achieved a brute force attack speed of 350 billion guesses per second, allowing them to check  password combinations in 5.5 hours. Using ocl-Hashcat Plus on a Virtual OpenCL cluster platform[11], the Linux-based GPU cluster was used to "crack 90 percent of the 6.5 million password hashes belonging to users of LinkedIn."[12]

For some specific hashing algorithms, CPUs and GPUs are not a good match. Purpose made hardware is required to run at high speeds. Custom hardware can be made using FPGA or ASIC technology. Development for both technologies is complex and (very) expensive. In general, FPGAs are favorable in small quantities, ASICs are favorable in (very) large quantities, more energy efficient and faster. In 1998, the Electronic Frontier Foundation (EFF) built a dedicated password cracker using ASICs. Their machine, Deep Crack, broke a DES 56-bit key in 56 hours, testing over 90 billion keys per second[13]. In 2017, leaked documents show that ASICs are used for a military project to code-break the entire internet[14]. Designing and buildig ASIC-basic password crackers is assumed to be out of reach for non-governments. Since 2019, John the Ripper supports password cracking for a limited number of hashing algorithms using FPGAs[15]. FPGA-based setups are now in use by commercial companies for password cracking[16].

Easy to remember, hard to guessEdit

Passwords that are difficult to remember will reduce the security of a system because (a) users might need to write down or electronically store the password using an insecure method, (b) users will need frequent password resets and (c) users are more likely to re-use the same password. Similarly, the more stringent requirements for password strength, e.g. "have a mix of uppercase and lowercase letters and digits" or "change it monthly", the greater the degree to which users will subvert the system.[17]

In "The Memorability and Security of Passwords",[18] Jeff Yan et al. examines the effect of advice given to users about a good choice of password. They found that passwords based on thinking of a phrase and taking the first letter of each word are just as memorable as naively selected passwords, and just as hard to crack as randomly generated passwords. Combining two unrelated words is another good method. Having a personally designed "algorithm" for generating obscure passwords is another good method.

However, asking users to remember a password consisting of a "mix of uppercase and lowercase characters" is similar to asking them to remember a sequence of bits: hard to remember, and only a little bit harder to crack (e.g. only 128 times harder to crack for 7-letter passwords, less if the user simply capitalizes one of the letters). Asking users to use "both letters and digits" will often lead to easy-to-guess substitutions such as 'E' → '3' and 'I' → '1', substitutions which are well known to attackers. Similarly typing the password one keyboard row higher is a common trick known to attackers.

Research detailed in an April 2015 paper by several professors at Carnegie Mellon University shows that people's choices of password structure often follow several known patterns. As a result, passwords may be much more easily cracked than their mathematical probabilities would otherwise indicate. Passwords containing one digit, for example, disproportionately include it at the end of the password.[19]


On July 16, 1998, CERT reported an incident where an attacker had found 186,126 encrypted passwords. By the time they were discovered, they had already cracked 47,642 passwords.[20]

In December 2009, a major password breach of the website occurred that led to the release of 32 million passwords. The attacker then leaked the full list of the 32 million passwords (with no other identifiable information) to the internet. Passwords were stored in cleartext in the database and were extracted through a SQL Injection vulnerability. The Imperva Application Defense Center (ADC) did an analysis on the strength of the passwords.[21]

In June 2011, NATO (North Atlantic Treaty Organization) experienced a security breach that led to the public release of first and last names, usernames, and passwords for more than 11,000 registered users of their e-bookshop. The data were leaked as part of Operation AntiSec, a movement that includes Anonymous, LulzSec, as well as other hacking groups and individuals.[22]

On July 11, 2011, Booz Allen Hamilton, a large American Consulting firm that does a substantial amount of work for the Pentagon, had their servers hacked by Anonymous and leaked the same day. "The leak, dubbed 'Military Meltdown Monday,' includes 90,000 logins of military personnel—including personnel from USCENTCOM, SOCOM, the Marine Corps, various Air Force facilities, Homeland Security, State Department staff, and what looks like private sector contractors."[23] These leaked passwords wound up being hashed with unsalted SHA-1, and were later analyzed by the ADC team at Imperva, revealing that even some military personnel used passwords as weak as "1234".[24]

On July 18, 2011, Microsoft Hotmail banned the password: "123456".[25]

In July 2015, a group calling itself "The Impact Team" stole the user data of Ashley Madison. Many passwords were hashed using both the relatively strong bcrypt algorithm and the weaker MD5 hash. Attacking the latter algorithm allowed some 11 million plaintext passwords to be recovered.


The best method of preventing a password from being cracked is to ensure that attackers cannot get access even to the hashed password[citation needed]. For example, on the Unix operating system, hashed passwords were originally stored in a publicly accessible file /etc/passwd. On modern Unix (and similar) systems, on the other hand, they are stored in the shadow password file /etc/shadow, which is accessible only to programs running with enhanced privileges (i.e., "system" privileges). This makes it harder for a malicious user to obtain the hashed passwords in the first instance, however many collections of password hashes have been stolen despite such protection. Another strong approach is to combine a site-specific secret key with the password hash, which prevents plaintext password recovery even if the hashed values are purloined. A third approach is to use key derivation functions that reduce the rate at which passwords can be guessed.[26]: Unfortunately, many common Network Protocols transmit passwords in cleartext or use weak challenge/response schemes.[27][28]

Modern Unix Systems have replaced traditional DES-based password hashing function crypt() with stronger methods such as bcrypt and scrypt.[29] Other systems have also begun to adopt these methods. For instance, the Cisco IOS originally used a reversible Vigenère cipher to encrypt passwords, but now uses md5-crypt with a 24-bit salt when the "enable secret" command is used.[30] These newer methods use large salt values which prevent attackers from efficiently mounting offline attacks against multiple user accounts simultaneously. The algorithms are also much slower to execute which drastically increases the time required to mount a successful offline attack.[31]

Many hashes used for storing passwords, such as MD5 and the SHA family, are designed for fast computation and efficient implementation in hardware. As a result, they are ineffective in preventing password cracking, especially with methods like rainbow tables. Using key stretching Algorithms, such as PBKDF2, to form password hashes can significantly reduce the rate at which passwords can be tested.

Solutions like a security token give a formal proof answer by constantly shifting password. Those solutions abruptly reduce the timeframe available for brute forcing (attacker needs to break and use the password within a single shift) and they reduce the value of the stolen passwords because of its short time validity.

In 2013 a long-term Password Hashing Competition was announced to choose a new, standard algorithm for password hashing.[32]


There are many password cracking software tools, but the most popular[33] are Aircrack, Cain and Abel, John the Ripper, Hashcat, Hydra, DaveGrohl and ElcomSoft. Many litigation support software packages also include password cracking functionality. Most of these packages employ a mixture of cracking strategies, algorithm with brute force and dictionary attacks proving to be the most productive.[citation needed]

The increased availability of computing power and beginner friendly automated password cracking software for a number of protection schemes has allowed the activity to be taken up by script kiddies.[34]

See alsoEdit


  1. ^ a b oclHashcat-lite – advanced password recovery. Retrieved on January 31, 2013.
  2. ^ Montoro, Massimiliano (2009). "Brute-Force Password Cracker". Archived from the original on August 20, 2013. Retrieved August 13, 2013.CS1 maint: unfit url (link)
  3. ^ Bahadursingh, Roman (January 19, 2020). [Roman Bahadursingh. (2020). A Distributed Algorithm for Brute Force Password Cracking on n Processors. "A Distributed Algorithm for Brute Force Password Cracking on n Processors"] Check |url= value (help). doi:10.5281/zenodo.3612276.
  4. ^ Lundin, Leigh (August 11, 2013). "PINs and Passwords, Part 2". Passwords. Orlando: SleuthSayers.
  5. ^ Alexander, Steven. (June 20, 2012) The Bug Charmer: How long should passwords be?. Retrieved on January 31, 2013.
  6. ^ Cryptohaze Blog: 154 Billion NTLM/sec on 10 hashes. (July 15, 2012). Retrieved on 2013-01-31.
  7. ^ John the Ripper benchmarks. (March 30, 2010). Retrieved on 2013-01-31.
  8. ^ Burr, W. E.; Dodson, D. F.; Polk, W. T. (2006). "Electronic Authentication Guideline" (PDF). NIST. doi:10.6028/NIST.SP.800-63v1.0.2. Retrieved March 27, 2008. Cite journal requires |journal= (help)
  9. ^ "64-bit key project status". Archived from the original on September 10, 2013. Retrieved March 27, 2008.
  10. ^ Password Recovery Speed table, from ElcomSoft. NTLM passwords, Nvidia Tesla S1070 GPU, accessed February 1, 2011
  11. ^
  12. ^ "25-GPU cluster cracks every standard Windows password in <6 hours". 2012.
  13. ^ "EFF DES Cracker machine brings honesty to crypto debate". EFF. Archived from the original on January 1, 2010. Retrieved June 7, 2020.
  15. ^ "John the Ripper 1.9.0-jumbo-1".
  16. ^ "Bcrypt password cracking extremely slow? Not if you are using hundreds of FPGAs!".
  17. ^ Managing Network Security. Fred Cohen & Associates. Retrieved on January 31, 2013.
  18. ^ Yan, J.; Blackwell, A.; Anderson, R.; Grant, A. (2004). "Password Memorability and Security: Empirical Results" (PDF). IEEE Security & Privacy Magazine. 2 (5): 25. doi:10.1109/MSP.2004.81.
  19. ^ Steinberg, Joseph (April 21, 2015). "New Technology Cracks 'Strong' Passwords – What You Need To Know". Forbes.
  20. ^ "CERT IN-98.03". Retrieved September 9, 2009.
  21. ^ "Consumer Password Worst Practices" (PDF).
  22. ^ "NATO Hack Attack". Retrieved July 24, 2011.
  23. ^ "Anonymous Leaks 90,000 Military Email Accounts in Latest Antisec Attack". July 11, 2011.
  24. ^ "Military Password Analysis". July 12, 2011.
  25. ^ "Microsoft's Hotmail Bans 123456". Imperva. July 18, 2011. Archived from the original on March 27, 2012.
  26. ^ Grassi, Paul A (June 2017). "SP 800-63B-3 – Digital Identity Guidelines, Authentication and Lifecycle Management". NIST. doi:10.6028/NIST.SP.800-63b. Cite journal requires |journal= (help)
  27. ^ Singer, Abe (November 2001). "No Plaintext Passwords" (PDF). Login. 26 (7): 83–91. Archived from the original (PDF) on September 24, 2006.
  28. ^ Cryptanalysis of Microsoft's Point-to-Point Tunneling Protocol. (July 7, 2011). Retrieved on 2013-01-31.
  29. ^ A Future-Adaptable Password Scheme. (March 13, 2002). Retrieved on 2013-01-31.
  30. ^ MDCrack FAQ 1.8. None. Retrieved on January 31, 2013.
  31. ^ Password Protection for Modern Operating Systems. Retrieved on January 31, 2013.
  32. ^ "Password Hashing Competition". Archived from the original on September 2, 2013. Retrieved March 3, 2013.
  33. ^ "Top 10 Password Crackers". Sectools. Retrieved November 1, 2009.
  34. ^ Anderson, Nate (March 24, 2013). "How I became a password cracker: Cracking passwords is officially a "script kiddie" activity now". Ars Technica. Retrieved March 24, 2013.

External linksEdit