Wgu D334 V1 Pre-Assessment Intro To Cryptography Questions And Correct Answers Plus Rationale Latest Update| Instant Download

WGU D334 V1 PRE-ASSESSMENT INTRO TO
CRYPTOGRAPHY QUESTIONS AND CORRECT
ANSWERS PLUS RATIONALE LATEST UPDATE
50 QUESTIONS

TABLE OF CONTENTS

# TOPIC

1 Analyze and evaluate symmetric and asymmetric cryptographic algorithms for security properties and
appropriate use cases

2 Apply cryptographic primitives (hash functions, MACs, digital signatures) to design secure protocols and
solve security problems

3 Assess the security of cryptographic systems, including key management, PKI, and common attack
vectors

4 WGU D334 V1 Pre

5 Assessment Intro to Cryptography Questions and Correct Answers Plus Rationale Latest Update

6 Foundations of Cryptography (WGU D334 V1)

7 Applied Cryptography (WGU D334 V1)

8 Advanced Cryptography (WGU D334 V1)

9 Cryptography (WGU D334 V1) Review


ABSTRACT

This study document brings together 50 carefully worded exam questions drawn from WGU D334
V1 Pre-Assessment Intro to Cryptography Questions and Correct Answers Plus Rationale Latest
Update, with the strongest emphasis placed on Analyze and evaluate symmetric and asymmetric
cryptographic algorithms for security properties and appropriate use cases, Apply cryptographic
primitives (hash functions, MACs, digital signatures) to design secure protocols and solve security
problems, Assess the security of cryptographic systems, including key management, PKI and and
common attack vectors. Every item follows the wording style and level of reasoning you meet in
the real paper, and each one is paired with a clear rationale so the correct choice is never a guess.
Work through the set at your own pace, mark the questions that slow you down, then come back to
them until the reasoning feels automatic. Learners who revise this way walk into the exam room
recognising the pattern behind the questions instead of meeting them for the first time. Keep going
- steady, honest practice is what turns a difficult paper into a comfortable pass.




Page 1

,Q1 ANALYZE AND EVALUATE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS FOR SECURITY PROPERTIES AND APPROPRIATE USE CASES
A company uses AES-256 in CBC mode with a fixed IV for encrypting multiple
messages under the same key. An attacker captures two ciphertexts. Which
statement best describes the security implication?
A. The fixed IV allows the attacker to detect if the plaintexts are identical in the first block.
CORRECT

B. The fixed IV enables a chosen-ciphertext attack to recover the key.

C. The fixed IV causes the ciphertexts to be identical if the plaintexts are identical.

D. The fixed IV weakens the encryption to a simple XOR cipher.

RATIONALE: In CBC mode, a fixed IV causes identical first plaintext blocks to produce identical
first ciphertext blocks, leaking equality of plaintext prefixes. It does not directly enable key
recovery or reduce to XOR. Option C is incorrect because subsequent blocks depend on
previous ciphertext blocks, so identical plaintexts with different lengths or subsequent blocks will
not yield identical full ciphertexts.




Q2 ANALYZE AND EVALUATE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS FOR SECURITY PROPERTIES AND APPROPRIATE USE CASES
In the context of RSA, which of the following is the primary reason for using
Optimal Asymmetric Encryption Padding (OAEP) instead of PKCS#1 v1.5 padding?
A. OAEP provides semantic security against chosen-ciphertext attacks, while PKCS#1 v1.5 is
vulnerable to Bleichenbacher's attack. CORRECT

B. OAEP increases the speed of RSA encryption by reducing the message size.

C. OAEP allows the use of smaller key sizes without compromising security.

D. OAEP enables deterministic encryption, which is required for digital signatures.

RATIONALE: OAEP is designed to be semantically secure against adaptive chosen-ciphertext
attacks, addressing the vulnerabilities of PKCS#1 v1.5, such as Bleichenbacher's padding oracle
attack. It does not speed up encryption or allow smaller keys. Option D is false because OAEP is
randomized, not deterministic.




Page 2

, Q3 ANALYZE AND EVALUATE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS FOR SECURITY PROPERTIES AND APPROPRIATE USE CASES
A security engineer must choose a cryptographic hash function for a digital
signature scheme. The requirement is collision resistance. Which of the following
hash functions is currently considered secure for this purpose?
A. MD5

B. SHA-1

C. SHA-256 CORRECT

D. SHA-0

RATIONALE: SHA-256 is part of the SHA-2 family and is currently considered collision-resistant
for practical purposes. MD5 and SHA-1 have known collision attacks, and SHA-0 is obsolete and
vulnerable. Thus, SHA-256 is the appropriate choice.




Q4 ANALYZE AND EVALUATE SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHIC
ALGORITHMS FOR SECURITY PROPERTIES AND APPROPRIATE USE CASES
In a Diffie-Hellman key exchange, an attacker can perform a man-in-the-middle
attack if the parties do not authenticate each other. Which cryptographic
mechanism best prevents this attack?
A. Using a larger prime modulus

B. Using ephemeral keys

C. Signing the exchanged public keys with a digital signature CORRECT

D. Hashing the shared secret before use

RATIONALE: Authentication of the public keys via digital signatures prevents an attacker from
substituting their own keys. Larger primes or ephemeral keys do not provide authentication.
Hashing the shared secret does not prevent MITM because the attacker can establish separate
shared secrets with each party.




Page 3