Brute Force Attack
A brute force attack is a hacking method where an attacker systematically tries many possible passwords, credentials, or encryption keys until the correct one is found. It relies on trial and error rather than exploiting a specific vulnerability, and its success typically depends on the complexity and length of the targeted secret. Given enough time and computing power, a brute force attack can theoretically crack any password or key, though strong credentials and protective controls can make such attacks impractical.
A brute force attack is a cryptanalytic or credential-guessing attack in which an adversary enumerates and submits a large number of candidate values (passwords, passphrases, encryption keys, or other authentication tokens) in an attempt to identify the correct one through exhaustive search. Variants include simple brute force (trying every possible combination), dictionary attacks (using precompiled wordlists), credential stuffing (reusing leaked credentials), and hybrid approaches that combine dictionary entries with permutations. The feasibility of the attack depends on the keyspace size, the computational cost per guess, and the presence of defensive controls such as account lockout policies, rate limiting, CAPTCHA challenges, multi-factor authentication, and adaptive throttling. In the context of encryption, brute force targets the key space directly, while in authentication scenarios it targets login endpoints or password hashes. Detection typically relies on monitoring for anomalous volumes of failed authentication attempts, though distributed or slow-rate brute force attacks may evade simple threshold-based detection mechanisms.
Why it matters
Brute force attacks remain one of the most persistent and commonly encountered threats against authentication systems and encrypted data. Because the technique relies on systematic trial and error rather than exploiting a specific software vulnerability, it can be attempted against virtually any system that accepts credentials or uses encryption keys. Even organizations with otherwise strong security postures can be vulnerable if they lack adequate controls such as account lockout policies, rate limiting, or multi-factor authentication. The simplicity of the attack method means that tooling is widely available and requires relatively low attacker sophistication to deploy.
The risk is amplified by the existence of attack variants that increase efficiency. Dictionary attacks use precompiled wordlists of common passwords, while credential stuffing leverages previously breached credentials to target accounts where users have reused passwords across services. Hybrid approaches combine dictionary entries with automated permutations, significantly reducing the effective keyspace an attacker must search. These variants mean that even passwords of moderate complexity may fall more quickly than a pure exhaustive search would suggest.
From a defensive standpoint, brute force attacks matter because they can be difficult to detect comprehensively. While high-volume attacks against a single account are relatively easy to identify through failed authentication monitoring, distributed or slow-rate brute force attacks, where attempts are spread across many source IPs or throttled to stay below detection thresholds, may evade simple threshold-based detection mechanisms. This makes layered defenses and behavioral analytics important components of any mitigation strategy.
Who it's relevant to
Inside Brute Force Attack
Common questions
Answers to the questions practitioners most commonly ask about Brute Force Attack.