WGU D830|D334 INTRO TO
CRYPTOGRAPHY | OA V1 AND V2
| QUESTIONS AND ANSWERS |
LATEST MOCK PRACTICE SET
130 Questions with Answers and Detailed Rationales
100 PERCENT GUARANTEED PASS
INSTANT DOWNLOAD ANSWERS INCLUDED
IMPORTANCE OF THIS DOCUMENT
This comprehensive examination preparation guide has been meticulously developed to help you succeed in the
WGU D830|D334 INTRO TO CRYPTOGRAPHY | OA V1 AND V2 | QUESTIONS AND ANSWERS | LATEST
2025/2026 UPDATE | 100% CORRECT. It contains 130 carefully selected questions that reflect the most current
exam content and testing strategies. Each question is accompanied by a correct answer and a detailed rationale
that explains the underlying pathophysiology, pharmacology, or clinical reasoning.
Self-Assessment – Test your knowledge and Exam Preparation – Familiarize yourself with the
identify areas requiring further question format and content
study areas
Concept Reinforcement – Deepen your Confidence Building – Develop test-taking
understanding through strategies and reduce
evidence-based exam anxiety
rationales
Time Management – Practice answering
questions under simulated
exam conditions
Review Summary 130 Questions
Foundations - Application - WGU D830 D334 Intro TO Cryptography OA V1 AND V2 AND 2025/2026
Update 100 Correct Cryptography Graduate
All answers with rationales
,Table of Contents
Content Area Questions Key Topics
Cryptography Fundamentals 1-22 Security, Attack, Power, Describes, Side-channel
Symmetric Cryptography 23-44 Cryptographic, Attacker, Security, Mechanism, Length
Asymmetric Cryptography 45-66 Security, Cryptographic, Attacker, Public, Cipher
HASH Functions AND Digital 67-88 Security, Attack, Prime, Problem, Against
Signatures
Public KEY Infrastructure PKI 89-110 Attacker, Nonce, Cryptographic, Context, Point
Cryptographic Protocols 111-130 Attack, Curve, Security, Describes, Elliptic
AND Applications
TOTAL 130 All questions include answers and detailed rationales
,Section A - Cryptography Fundamentals
Q1.
In a side-channel attack on an RSA implementation, an attacker measures the power
consumption during modular exponentiation. Which countermeasure is most effective in
preventing this specific attack by breaking the correlation between the secret exponent
and the power trace?
A. Blinding the ciphertext with a random B. Using a larger modulus size (e.g., 4096
value before exponentiation bits)
C. Implementing the exponentiation with a D. Using a different public exponent (e.g.,
fixed-window algorithm 65537 instead of 3)
Correct: A - Blinding the ciphertext with a random value before exponentiation
Rationale:Blinding randomizes the ciphertext before exponentiation, so the power trace no
longer correlates with the actual exponent. Larger modulus or fixed-window algorithms reduce
but do not eliminate the correlation. Changing the public exponent does not affect the private
exponent's leakage.
Q2.
A system uses a 128-bit block cipher in CBC mode for encrypting files. An attacker
modifies a single bit in the ciphertext block C_i. Which of the following statements about
the impact on decryption is correct?
A. Only plaintext block P_i is corrupted, and B. Both P_i and P_{i+1} are corrupted, with
P_{i+1} remains intact P_i having a random bit flip and P_{i+1}
having the same bit flip
C. Only plaintext block P_{i+1} is corrupted, D. Both P_i and P_{i+1} are corrupted, with
with the same bit flipped P_i having the same bit flip and P_{i+1}
having a random bit flip
Correct: D - Both P_i and P_{i+1} are corrupted, with P_i having the same bit flip and
P_{i+1} having a random bit flip
Rationale:In CBC decryption, P_i = D(C_i) XOR C_{i-1}. A bit flip in C_i directly flips the
corresponding bit in P_i. Also, C_i is used in the XOR for P_{i+1} = D(C_{i+1}) XOR C_i, so
the same bit flip appears in P_{i+1}. Hence both blocks are corrupted as described.
Q3.
In the context of elliptic curve cryptography (ECC), which of the following operations is
the most computationally expensive and therefore the primary target for optimization in
practical implementations?
Page 3
, Section A - Cryptography Fundamentals
A. Point addition of two distinct points B. Point doubling of a single point
C. Scalar multiplication of a point by an D. Field inversion in the underlying finite
integer field
Correct: C - Scalar multiplication of a point by an integer
Rationale:Scalar multiplication (kP) is the core operation in ECC key exchange and
signatures; it involves many point additions and doublings, making it the most expensive.
Field inversion is used within point operations but is not the overall dominant operation. Point
addition and doubling are single steps.
Q4.
A security architect is designing a system that must ensure non-repudiation of a message
sent by a user. Which combination of cryptographic primitives is required to achieve this?
A. Symmetric encryption with a shared B. Hash function and a digital signature
secret key algorithm
C. Message authentication code (MAC) D. Public-key encryption of the message
using a shared key with the recipient's public key
Correct: B - Hash function and a digital signature algorithm
Rationale:Non-repudiation requires that the sender cannot deny sending the message. This
is achieved by digitally signing the hash of the message with the sender's private key.
Symmetric encryption and MACs use shared keys, which cannot provide non-repudiation
because both parties possess the key. Public-key encryption ensures confidentiality, not
non-repudiation.
Q5.
In the Diffie-Hellman key exchange, an attacker intercepts the public values g^a and g^b.
Which of the following attacks is feasible if the prime modulus p is chosen poorly (e.g.,
p-1 has only small prime factors)?
A. Brute-force attack on the shared secret B. Pohlig-Hellman attack to compute the
by trying all possible a and b discrete logarithm efficiently
C. Man-in-the-middle attack by substituting D. Padding oracle attack to recover the
public keys private keys
Correct: B - Pohlig-Hellman attack to compute the discrete logarithm efficiently
Page 4
CRYPTOGRAPHY | OA V1 AND V2
| QUESTIONS AND ANSWERS |
LATEST MOCK PRACTICE SET
130 Questions with Answers and Detailed Rationales
100 PERCENT GUARANTEED PASS
INSTANT DOWNLOAD ANSWERS INCLUDED
IMPORTANCE OF THIS DOCUMENT
This comprehensive examination preparation guide has been meticulously developed to help you succeed in the
WGU D830|D334 INTRO TO CRYPTOGRAPHY | OA V1 AND V2 | QUESTIONS AND ANSWERS | LATEST
2025/2026 UPDATE | 100% CORRECT. It contains 130 carefully selected questions that reflect the most current
exam content and testing strategies. Each question is accompanied by a correct answer and a detailed rationale
that explains the underlying pathophysiology, pharmacology, or clinical reasoning.
Self-Assessment – Test your knowledge and Exam Preparation – Familiarize yourself with the
identify areas requiring further question format and content
study areas
Concept Reinforcement – Deepen your Confidence Building – Develop test-taking
understanding through strategies and reduce
evidence-based exam anxiety
rationales
Time Management – Practice answering
questions under simulated
exam conditions
Review Summary 130 Questions
Foundations - Application - WGU D830 D334 Intro TO Cryptography OA V1 AND V2 AND 2025/2026
Update 100 Correct Cryptography Graduate
All answers with rationales
,Table of Contents
Content Area Questions Key Topics
Cryptography Fundamentals 1-22 Security, Attack, Power, Describes, Side-channel
Symmetric Cryptography 23-44 Cryptographic, Attacker, Security, Mechanism, Length
Asymmetric Cryptography 45-66 Security, Cryptographic, Attacker, Public, Cipher
HASH Functions AND Digital 67-88 Security, Attack, Prime, Problem, Against
Signatures
Public KEY Infrastructure PKI 89-110 Attacker, Nonce, Cryptographic, Context, Point
Cryptographic Protocols 111-130 Attack, Curve, Security, Describes, Elliptic
AND Applications
TOTAL 130 All questions include answers and detailed rationales
,Section A - Cryptography Fundamentals
Q1.
In a side-channel attack on an RSA implementation, an attacker measures the power
consumption during modular exponentiation. Which countermeasure is most effective in
preventing this specific attack by breaking the correlation between the secret exponent
and the power trace?
A. Blinding the ciphertext with a random B. Using a larger modulus size (e.g., 4096
value before exponentiation bits)
C. Implementing the exponentiation with a D. Using a different public exponent (e.g.,
fixed-window algorithm 65537 instead of 3)
Correct: A - Blinding the ciphertext with a random value before exponentiation
Rationale:Blinding randomizes the ciphertext before exponentiation, so the power trace no
longer correlates with the actual exponent. Larger modulus or fixed-window algorithms reduce
but do not eliminate the correlation. Changing the public exponent does not affect the private
exponent's leakage.
Q2.
A system uses a 128-bit block cipher in CBC mode for encrypting files. An attacker
modifies a single bit in the ciphertext block C_i. Which of the following statements about
the impact on decryption is correct?
A. Only plaintext block P_i is corrupted, and B. Both P_i and P_{i+1} are corrupted, with
P_{i+1} remains intact P_i having a random bit flip and P_{i+1}
having the same bit flip
C. Only plaintext block P_{i+1} is corrupted, D. Both P_i and P_{i+1} are corrupted, with
with the same bit flipped P_i having the same bit flip and P_{i+1}
having a random bit flip
Correct: D - Both P_i and P_{i+1} are corrupted, with P_i having the same bit flip and
P_{i+1} having a random bit flip
Rationale:In CBC decryption, P_i = D(C_i) XOR C_{i-1}. A bit flip in C_i directly flips the
corresponding bit in P_i. Also, C_i is used in the XOR for P_{i+1} = D(C_{i+1}) XOR C_i, so
the same bit flip appears in P_{i+1}. Hence both blocks are corrupted as described.
Q3.
In the context of elliptic curve cryptography (ECC), which of the following operations is
the most computationally expensive and therefore the primary target for optimization in
practical implementations?
Page 3
, Section A - Cryptography Fundamentals
A. Point addition of two distinct points B. Point doubling of a single point
C. Scalar multiplication of a point by an D. Field inversion in the underlying finite
integer field
Correct: C - Scalar multiplication of a point by an integer
Rationale:Scalar multiplication (kP) is the core operation in ECC key exchange and
signatures; it involves many point additions and doublings, making it the most expensive.
Field inversion is used within point operations but is not the overall dominant operation. Point
addition and doubling are single steps.
Q4.
A security architect is designing a system that must ensure non-repudiation of a message
sent by a user. Which combination of cryptographic primitives is required to achieve this?
A. Symmetric encryption with a shared B. Hash function and a digital signature
secret key algorithm
C. Message authentication code (MAC) D. Public-key encryption of the message
using a shared key with the recipient's public key
Correct: B - Hash function and a digital signature algorithm
Rationale:Non-repudiation requires that the sender cannot deny sending the message. This
is achieved by digitally signing the hash of the message with the sender's private key.
Symmetric encryption and MACs use shared keys, which cannot provide non-repudiation
because both parties possess the key. Public-key encryption ensures confidentiality, not
non-repudiation.
Q5.
In the Diffie-Hellman key exchange, an attacker intercepts the public values g^a and g^b.
Which of the following attacks is feasible if the prime modulus p is chosen poorly (e.g.,
p-1 has only small prime factors)?
A. Brute-force attack on the shared secret B. Pohlig-Hellman attack to compute the
by trying all possible a and b discrete logarithm efficiently
C. Man-in-the-middle attack by substituting D. Padding oracle attack to recover the
public keys private keys
Correct: B - Pohlig-Hellman attack to compute the discrete logarithm efficiently
Page 4
