Cyber test 1 part 2

3 flashcardsby Cal
Study these flashcardsFree · spaced repetition · iPhone, Android, Mac & web

All cards

1
Exhaustive brute force
Trying all possible
combinations until
something hashes to the
given value.
How many possible passwords are there?
Number of possible passwords depends on
the implementation
If
● C = size of Character set
● L = Length of the password
Number of Possible Passwords = C^L
to improve password: increase character set and length (Length can have greater impact than character space.)
2
credential stuffing
brute force attack in which credentials obtained from a
data breach on one service are used to attempt to log in to another unrelated
service
Relies on human tendency to reuse passwords
3
dictionary attacks
brute-force method that systematically enters every word in a word list
as a password
● Can be any type of dictionary (as well as derivatives of those words) but is frequently a
collection of previously leaked passwords (passwords exposed in a security breach)
● Also check for clever substitutions in
dictionary words
○ Zero for letter O, 3 for letter E, etc.
○ Leetspeak (typing style that replaces
letters with similar looking numbers
and symbols). Ex. P4$$w0rd
Study all 3 cards for free