liveBook · Manning

Brute-force attack

As explained in 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.

A brute-force attack uses a program to try every possible combination of letters, numbers, and special characters until it finds a password or exhausts the search. section 11.2.1

Attack feasibility decreases as password length and complexity increase, making sufficiently strong passwords an important defense. section 11.2.1

Distinguish brute force from related password attacks:

  • Guessing uses information about the target, such as birthdays or pets’ names. section 11.2.1
  • A dictionary attack tests entries from a list of common passwords rather than every possible character combination. section 11.2.1 section 11.6
  • Long, complex, unique, and difficult-to-guess passwords reduce exposure to these methods. section 11.2.1 section 11.6

How Acing the CCNA Exam: Volume 2 Advanced Networking and Security covers it

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 it assumes
Assumes familiarity with username/password authentication while defining password attacks and protective password qualities.
What you can do after
Evaluate password exposure by relating attack feasibility to password length and complexity.
How it connects
Connects brute-force attacks with dictionary attacks, password strength, password guessing, and OSINT reconnaissance.

Also explained in

Compare how 2 books explain brute-force attack →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Acing the CCNA Exam: Volume 2 Advanced Networking and Security. The section links point to the parts of the book it draws on.