Cybersecurity Essentials Chapter 5 Review

This strategy for cracking a has attempts every possible code until a match is found.

• brute force

• dictionary

• rainbow table

• lookup table

This type of attack against a hash attempts the common words, phrases, and passwords in a language.

• brute force

• dictionary

• rainbow table

• lookup table

Select the two basic hash algorithms listed below. (Pick2)

• Message Digest 5

• Secure Hash Algorithm - 1

• HMAC

• WPA

Select the situations listed below when hashing should be used. (Select all that apply!)

• When you need to ensure file integrity.

• PKI Certificates

• IPsec Protocols

• Routing Authentication

• Challenge Response Protocols (CHAP)

Which of the following does NOT accurately describe hashing.

• One way math function

• Fixed Output Length

• Fixed Input Length

• Two different inputs almost never give the same output

This is how HMAC is different from other basic hash algorithms.

• One way math function

• Fixed Output Length

• Requires a secret key along with the message digest

• Variable Input Length

This is the purpose of CSPRNG

• Perform hash calculations

• Encrypt data

• Generate Salts

• Concatenate Strings in Programming

Which of the following is NOT a good practice when implementing salting?

• Salts unique for each password

• Salts are never reused

• Salt lengths that are different from hash output lengths

• Hashes always performed on the server

Smaller table for cracking hashes that sacrifices speed to make the table smaller.

• Lookup Table

• Reverse Lookup Table

• Rainbow Table

• Salting Table

This prevents two users with the same password from having the same hash in a data base.

• Peppering

• Hashing

• Salting

• Rainbow Table