Dictionary attack

Short description: Technique for defeating password protection using lists of likely possibilities

In cryptanalysis and computer security, a dictionary attack is an attack using a restricted subset of a keyspace to defeat a cipher or authentication mechanism by trying to determine its decryption key or passphrase, sometimes trying thousands or millions of likely possibilities[1] often obtained from lists of past security breaches.

## Contents

* 1 Technique
* 2 Pre-computed dictionary attack/Rainbow table attack
* 3 Dictionary attack software
* 4 See also
* 5 References
* 6 External links

## Technique

A dictionary attack is based on trying all the strings in a pre-arranged listing. Such attacks originally used words found in a dictionary (hence the phrase dictionary attack);[2] however, now there are much larger lists available on the open Internet containing hundreds of millions of passwords recovered from past data breaches.[3] There is also cracking software that can use such lists and produce common variations, such as substituting numbers for similar-looking letters. A dictionary attack tries only those possibilities which are deemed most likely to succeed. Dictionary attacks often succeed because many people have a tendency to choose short passwords that are ordinary words or common passwords; or variants obtained, for example, by appending a digit or punctuation character. Dictionary attacks are often successful, since many commonly used password creation techniques are covered by the available lists, combined with cracking software pattern generation. A safer approach is to randomly generate a long password (15 letters or more) or a multiword passphrase, using a password manager program or manually typing a password.

Dictionary attacks can be deterred by the server administrator by using a more computationally expensive hashing algorithm. Bcrypt, scrypt, and Argon2 are examples of such resource intensive functions that require significant computational power to process,[4] allowing for large improvements in security against dictionary attacks. While other hashing functions, such as SHA and MD5, are much faster and less expensive to compute, they can still be strengthened by being applied multiple times to an input string through a process called key stretching. An attacker would have to know approximately how many times the function was applied for a dictionary attack to be feasible.

## Pre-computed dictionary attack/Rainbow table attack

It is possible to achieve a time–space tradeoff by pre-computing a list of hashes of dictionary words and storing these in a database using the hash as the key. This requires a considerable amount of preparation time, but this allows the actual attack to be executed faster. The storage requirements for the pre-computed tables were once a major cost, but now they are less of an issue because of the low cost of disk storage. Pre-computed dictionary attacks are particularly effective when a large number of passwords are to be cracked. The pre-computed dictionary needs be generated only once, and when it is completed, password hashes can be looked up almost instantly at any time to find the corresponding password. A more refined approach involves the use of rainbow tables, which reduce storage requirements at the cost of slightly longer lookup-times. See LM hash for an example of an authentication system compromised by such an attack.

Pre-computed dictionary attacks, or "rainbow table attacks", can be thwarted by the use of salt, a technique that forces the hash dictionary to be recomputed for each password sought, making precomputation infeasible, provided that the number of possible salt values is large enough.[5]

## Dictionary attack software

* Cain and Abel
* Crack
* Aircrack-ng
* John the Ripper
* Hashcat
* L0phtCrack
* Metasploit Project
* Ophcrack
* Cryptool

## See also

* Brute-force attack
* E-mail address harvesting
* Intercontinental Dictionary Series, an online linguistic database
* Key derivation function
* Key stretching
* Password cracking
* Password strength

## References

1. ↑ Junghyun Nam; Juryon Paik; Hyun-kyu Kang; Ung Kim; Dongho Won (2009-03-01). "An off-line dictionary attack on a simple three-party key exchange protocol". IEEE Communications Letters 13 (3): 205–207. doi:10.1109/LCOMM.2009.081609. ISSN 1089-7798. Bibcode: 2009IComL..13..205N.
2. ↑ Jeff Atwood. "Dictionary Attacks 101".
3. ↑ CrackStation's list. e.g., with over 1.4 billion words.
4. ↑ "Key Stretching Algorithms: Basics, Algorithms & Techniques". 29 September 2024. https://bootcampsecurity.com/blog/key-stretching-algorithms-basics-algorithms-techniques/.
5. ↑ "CAPEC - CAPEC-55: Rainbow Table Password Cracking (Version 3.5)". https://capec.mitre.org/data/definitions/55.html.

## External links

* RFC 2828 – Internet Security Glossary
* RFC 4949 – Internet Security Glossary, Version 2
* US Secret Service use a distributed dictionary attack on suspect's password protecting encryption keys
* Testing for Brute Force (OWASP-AT-004)

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Dictionary attack. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Dictionary_attack&oldid=3991471"