liveBook · Manning

Brute-force attack

A brute-force attack systematically tries numerous possible credentials, keys, inputs, or combinations until one succeeds or the search space is exhausted.

How 2 Manning books explain it

Grokking Web Application Security

A brute-force attack is an automated attack that repeatedly tries credential guesses or other candidate values until one succeeds.

How it is used
Frames credential-guessing risk and motivates layered protections for login, registration, and password-reset flows.
How deep it goes
Explains attack mechanics, wordlists, enumeration, CAPTCHA integration, and rate-limiting trade-offs without a formal threat model.
Examples
Uses Hydra wordlists, differentiated login errors, reCAPTCHA tokens, exponential backoff, and zxcvbn password-strength feedback.
What you can do after
Apply it via reCAPTCHA, rate limiting, uniform responses, stronger passwords, MFA, and secure password storage.

Read how Grokking Web Application Security explains brute-force attack →

Acing the CCNA Exam: Volume 2 Advanced Networking and Security

A brute-force attack systematically tries possible character combinations until a password is found or the search is exhausted.

How it is used
Identifies a password-attack technique and motivates stronger password practices.
How deep it goes
Defines exhaustive character-combination testing and contrasts it with guessing and dictionary attacks, without detailing implementation.
Examples
Uses character combinations, birthdays, pets’ names, and common-password lists to distinguish attack approaches.
What you can do after
Evaluate password exposure by relating attack feasibility to password length and complexity.

Read how Acing the CCNA Exam: Volume 2 Advanced Networking and Security explains brute-force attack →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.