CREST Cryptography & PKI 3

Question 1

What is a rainbow table attack used for?

Accepted Answer

Cracking password hashes using precomputed hash chains

Answer

Intercepting encrypted network traffic

Answer

Exploiting weak SSL cipher suites

Answer

Performing man-in-the-middle attacks on PKI

Question 2

Which countermeasure is most effective against rainbow table attacks?

Accepted Answer

Using a unique random salt per password before hashing

Answer

Using MD5 instead of SHA-1

Answer

Storing passwords in plaintext

Answer

Using a 64-bit hash function

Question 3

What is the Diffie-Hellman key exchange used for?

Accepted Answer

Establishing a shared secret over an insecure channel without transmitting it

Answer

Encrypting bulk data efficiently

Answer

Generating digital certificates

Answer

Verifying certificate revocation status

Question 4

Which of the following is a known weakness of the MD5 hashing algorithm?

Accepted Answer

It is vulnerable to collision attacks

Answer

It produces a 512-bit digest

Answer

It requires a secret key for computation

Answer

It is computationally too slow for passwords

Question 5

What does certificate pinning protect against?

Accepted Answer

Fraudulent certificates issued by rogue or compromised CAs

Answer

Weak cipher suite negotiation

Answer

SSL stripping attacks

Answer

Session fixation

Question 6

In the context of CREST examinations, which hashing algorithm family is currently recommended for integrity verification in security tools?

Accepted Answer

SHA-2 (e.g., SHA-256 or SHA-512)

Answer

MD5

Answer

SHA-1

Answer

CRC32