Brute-Force Attack
Subject: Computer and Technology noun /ˈbruːt ˌfɔːrs əˈtæk/ 1 definition
- information-security
- network-security
- password-cracking
- access-control
-
Definition (noun)
Entry #196 · UpdatedA Brute-Force Attack is an exhaustive trial-and-error technique used to uncover valid credentials, cryptographic keys, or hidden resources by systematically generating and testing every possible character combination or key value until a match succeeds. Rather than exploiting a software vulnerability or relying on prior knowledge, it depends entirely on computational throughput and automation to search the full input space. Its feasibility is bounded by keyspace size and entropy, making adequate secret length and complexity—alongside rate limiting, account lockouts, and key stretching—effective defenses.
Common Types
Simple Brute-Force Attack: Systematically tests every possible character or bit combination without prior hints, making it most practical against short PINs, legacy ciphers, or offline password hashes.
Dictionary Attack: Iterates through curated wordlists of common words, phrases, and previously leaked passwords rather than every permutation, trading exhaustive coverage for speed.
Hybrid Brute-Force Attack: Combines dictionary words with automated rule-based mutations—such as appending digits, capitalizing letters, or substituting symbols—to crack predictable user-chosen passwords.
Reverse Brute-Force Attack: Tests a single common password against a large set of usernames (closely related to password spraying) to bypass per-account lockout thresholds.
Example
After obtaining a dump of unsalted SHA-256 password digests, an attacker uses a GPU-accelerated rig capable of testing billions of character combinations per second. Within hours, the brute-force attack recovers eight-character alphanumeric passwords, while random twelve-character passphrases remain computationally infeasible to crack.